Monografie

Generalized Max Flow in Series-Parallel Graphs

zu Verbundenen Objekten

Sprache
Englisch
Identifier
1027389457

Reihe
Report in Wirtschaftsmathematik (WIMA Report); 125

Beteiligte Personen und Organisationen
Beygang, Katharina
Krumke, Sven O.
Zeck, Christiane

URN
Rechteinformation
Der Zugriff auf das Objekt ist unbeschränkt möglich.
Letzte Aktualisierung
26.01.2023, 13:55 MEZ

Datenpartner

Deutsche Nationalbibliothek
Original beim Datenpartner anzeigen

Objekttyp

  • Monografie

Beteiligte

Ähnliche Objekte (12)

Train Marshalling Problem - Algorithms and Bounds

Monografie

Train Marshalling Problem - Algorithms and Bounds

Dynamic Multi-Period Routing With Two Classes

Monografie

Dynamic Multi-Period Routing With Two Classes

Online Delay Management

Monografie

Online Delay Management

The Generalized Assignment Problem with Minimum Quantities

The Generalized Assignment Problem with Minimum Quantities

Selfish Bin Coloring

Monografie

Selfish Bin Coloring

Efficient Computation of Equilibria in Bottleneck Games via Game Transformation

Monografie

Efficient Computation of Equilibria in Bottleneck Games via Game Transformation

Earliest Arrival Flows in Series-Parallel Graphs

Monografie

Earliest Arrival Flows in Series-Parallel Graphs

On Algorithmic Certification of Graph Structures

Monografie

On Algorithmic Certification of Graph Structures

A Parametric View on Robust Graph Problems

Monografie

A Parametric View on Robust Graph Problems

Fastest Paths, Almost Disjoint Paths, and Beyond

Monografie

Fastest Paths, Almost Disjoint Paths, and Beyond

Asymptotic order of the parallel volume difference

Monografie

Asymptotic order of the parallel volume difference

Asymptotic Order of the Parallel Volume Difference

Monografie

Asymptotic Order of the Parallel Volume Difference

Verbundene Objekte