12 search results - page 1 / 3 » Approximating the single source unsplittable min-cost flow p... |
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
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...
FOCS
1998
IEEE
13 years 9 months ago
1998
IEEE
SODA
2012
ACM
11 years 7 months ago
2012
ACM
Given an integer h, a graph G = (V, E) with arbitrary positive edge capacities and k pairs of vertices (s1, t1), (s2, t2), . . . , (sk, tk), called terminals, an h-route cut is a ...
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)...