160 search results - page 2 / 32 » Strongly Polynomial Algorithms for the Unsplittable Flow Pro... |
ALGORITHMICA
2006
13 years 6 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)...
ALGORITHMICA
2007
13 years 6 months ago
2007
FOCS
2000
IEEE
13 years 9 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 ...
WAOA
2010
Springer
13 years 4 months ago
2010
Springer
Abstract. We consider the train delivery problem which is a generalization of the bin packing problem and is equivalent to a one dimensional version of the vehicle routing problem ...
CORR
2008
Springer
13 years 6 months ago
2008
Springer
The unsplittable flow problem is one of the most extensively studied optimization problems in the field of networking. An instance of it consists of an edge capacitated graph and ...