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 graph with edge capacities and costs; the demand of each commodity must be routed along a single path so that the total flow through any edge is at most its capacity. Moreover, the total cost must not exceed a given budget. This problem has been introduced by Kleinberg [7] and generalizes several NP-complete problems from various areas in combinatorial optimization such as packing, partitioning, scheduling, load balancing, and virtual-circuit routing.
Kolliopoulos and Stein [9] and Dinitz, Garg, and Goemans [4] developed algorithms improving the first approximation results of Kleinberg for the problem of minimizing the violation of edge capacities and for other variants. However, known techniques do not seem to be 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.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: August 23, 2000 / Accepted: April 20, 2001¶Published online October 2, 2001
Rights and permissions
About this article
Cite this article
Skutella, M. Approximating the single source unsplittable min-cost flow problem. Math. Program. 91, 493–514 (2002). https://doi.org/10.1007/s101070100260
Published:
Issue Date:
DOI: https://doi.org/10.1007/s101070100260