100 search results - page 1 / 20 » Approximation Algorithms for the Unsplittable Flow Problem |
ALGORITHMICA
2007
13 years 5 months ago
2007
ALGORITHMICA
2006
13 years 4 months ago
2006
We provide combinatorial algorithms for the unsplittable flow problem (UFP) that either match or improve the previously best results. In the UFP we are given a (possibly directed)...
FOCS
2000
IEEE
13 years 8 months ago
2000
IEEE
Abstract. In the single source unsplittable min-cost flow problem, commodities must be routed simultaneously from a common source vertex to certain destination vertices in a given ...
ESA
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. Classical network flow theory allows decomposition of flow into several chunks of arbitrary sizes traveling through the network on different paths. In the first part ...
ESA
2007
Springer
13 years 11 months ago
2007
Springer
In the single source unsplittable flow problem, commodities must be routed simultaneously from a common source vertex to certain destination vertices in a given digraph. The deman...