Searching for "The Quickest Multicommodity Flow Problem." – sorted by Relevance.
-
The Quickest Multicommodity Flow Problem
- The Quickest Multicommodity Flow Problem ? Lisa Fleischer 1 and Martin Skutella 2 1 Graduate
- Cited by 21 (10 self) – Add To MetaCart
-
An FPTAS for Quickest Multicommodity Flows with Inflow-Dependent Transit Times
- time approximation scheme (FPTAS) for the quickest multicommodity flow problem with bounded cost. 1
- Cited by 5 (1 self) – Add To MetaCart
-
Multicommodity flows over time: Efficient algorithms and complexity
- , even in the NP-hard setting with costs [6, 4]. However, for the quickest multicommodity flow problem
- Cited by 8 (4 self) – Add To MetaCart
-
Flows over Time with Load-Dependent Transit Times
- and also to the more general quickest multicommodity flow problem with costs. Their approach is based
- Cited by 6 (3 self) – Add To MetaCart
-
Quickest Flows Over Time
- for the NP-hard quickest min-cost and multicommodity flow problems. For single commodity problems, we show
- Cited by 5 (3 self) – Add To MetaCart
-
Minimum Cost Flows over Time without Intermediate Storage
- for the quickest multicommodity flow problem. Finally, using completely different techniques, we describe a very
- Cited by 12 (5 self) – Add To MetaCart
-
Implicit Maximization of Flows over Time
- are used within an FPTAS [5] for the quickest multicommodity flow problem, for which no polynomial
- Cited by 1 (0 self) – Add To MetaCart

