Multicommodity Flow in Trees: Packing via Covering and Iterated Relaxation
- 247 Downloads
We consider the max-weight integral multicommodity flow problem in trees. In this problem we are given an edge-, arc-, or vertex-capacitated tree and weighted pairs of terminals, and the objective is to find a max-weight integral flow between terminal pairs subject to the capacities. This problem is APX-hard and a 4-approximation for the edge- and arc-capacitated versions is known. Some special cases are exactly solvable in polynomial time, including when the graph is a path or a star.
We show that all three versions of this problems fit in a common framework: first, prove a counting lemma in order to use the iterated LP relaxation method; second, solve a covering problem to reduce the resulting infeasible solution back to feasibility without losing much weight. The result of the framework is a 1+O(1/μ)-approximation algorithm where μ denotes the minimum capacity, for all three versions. A complementary hardness result shows this is asymptotically best possible. For the covering analogue of multicommodity flow, we also show a 1+Θ(1/μ) approximability threshold with a similar framework.
When the tree is a spider (i.e. only one vertex has degree greater than 2), we give a polynomial-time exact algorithm and a polyhedral description of the convex hull of all feasible solutions. This holds more generally for instances we call root-or-radial.
A preliminary version of this work appeared in Könemann et al. (Proc. 6th Int. Workshop Approx. & Online Alg. (WAOA), pp. 1–14, 2008).
KeywordsMulticommodity flow Approximation algorithms Iterated LP relaxation Polyhedral combinatorics
We would like to thank Joseph Cheriyan, Jim Geelen, András Sebő, and Chaitanya Swamy for useful discussions, and the WAOA and Algorithmica reviewers for their helpful comments.
- 12.Edmonds, J., Johnson, E.: Matching: A well-solved class of integer linear programs. In: Guy, R., Hanani, H., Sauer, N., Schonheim, J. (eds.) Combinatorial Structures and Their Applications (Proc. 1969 Calgary Conf. Comb. Struct. Appl.), pp. 89–92. Gordon and Breach, New York (1970) Google Scholar
- 18.Gabow, H.N., Goemans, M.X., Tardos, É., Williamson, D.P.: Approximating the smallest k-edge connected spanning subgraph by LP-rounding. Networks 53(4), 345–357 (2009). doi: 10.1002/net.20289. Preliminary version in Proc. 16th Symp. Disc. Alg. (SODA), pp. 562–571 (2005) CrossRefMATHMathSciNetGoogle Scholar
- 19.Garg, N., Vazirani, V.V., Yannakakis, M.: Primal-dual approximation algorithms for integral flow and multicut in trees. Algorithmica 18(1), 3–20 (1997). doi: 10.1007/BF02523685. Preliminary version in Proc. 20th Int. Colloq. Automata, Lang. & Prog. (ICALP), pp. 64–75 (1993) CrossRefMATHMathSciNetGoogle Scholar
- 21.Guruswami, V., Khanna, S., Rajaraman, R., Shepherd, F.B., Yannakakis, M.: Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems. J. Comput. Syst. Sci. 67(3), 473–496 (2003). Preliminary version in Proc. 31st Symp. Theory Comp. (STOC), pp. 19–28 (1999) CrossRefMATHMathSciNetGoogle Scholar
- 24.Kann, V.: On the approximability of NP-complete optimization problems. PhD thesis, Royal Institute of Technology Stockholm (1992) Google Scholar
- 35.Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Springer, Berlin (2003). 3-540-44389-4 Google Scholar