This Article 
 Bibliographic References 
 Add to: 
41st Annual Symposium on Foundations of Computer Science
Approximating the single source unsplittable min-cost flow problem
Redondo Beach, California
November 12-November 14
ISBN: 0-7695-0850-2
M. Skutella, Fachbereich Math., Tech. Univ. Berlin, Germany
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 graph with edge capacities and costs; the demand of each commodity must be routed along a single path and the total cost must not exceed a given budget. This problem has been introduced by J.M. Kleinberg (1996) and generalizes several NP-complete problems from various areas in combinatorial optimization such as packing, partitioning, scheduling load balancing, and virtual-circuit routing. S.G. Kolliopoulos and C. Stein (2000) and Y.N. Dinitz et al. (1999) developed algorithms improving the first approximation results of Kleinberg for the problem to minimize the violation of edge capacities and for other variants. However, none of the developed techniques is capable of providing solutions without also violating the cost constraint. We give the first approximation results with hard cost constraints. Moreover all our results dominate the best known bicriteria approximations. Finally, we provide results on the hardness of approximation for several variants of the problem.
Index Terms:
computational complexity; optimisation; processor scheduling; resource allocation; single source unsplittable min-cost flow problem; common source vertex; destination vertices; edge capacities; NP-complete problems; combinatorial optimization; packing; partitioning; load balancing; virtual-circuit routing; hard cost constraints; bicriteria approximations; hardness
M. Skutella, "Approximating the single source unsplittable min-cost flow problem," focs, pp.136, 41st Annual Symposium on Foundations of Computer Science, 2000
Usage of this product signifies your acceptance of the Terms of Use.