This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Recommended Reading
Andrews M, Chuzhoy J, Khanna S, Zhang L (2005) Hardness of the undirected edge-disjoint paths problem with congestion. In: Proceedings of the IEEE FOCS, pp 226–244
Azar Y, Regev O (2006) Combinatorial algorithms for the unsplittablae flow problem. Algorithmica 44(1):49–66, Preliminary version in Proceedings of the IPCO 2001
Chekuri C, Khanna S, Shepherd FB (2004) Edge-disjoint paths in Planar graphs. In: Proceedings of the IEEE FOCS, pp 71–80
Chekuri C, Khanna S, Shepherd FB (2004) The all-or-nothing multicommodity flow problem. In: Proceedings of the ACM STOC, pp 156–165
Chekuri C, Khanna S, Shepherd FB (2005) Multicommodity flow, well-linked terminals, and routing problems. In: Proceedings of the ACM STOC, pp 183–192
Chekuri C, Khanna S, Shepherd FB (2006) Edge-disjoint paths in planar graphs with constant congestion. In: Proceedings of the ACM STOC, pp 757–766
Chekuri C, Khanna S, Shepherd FB (2006) An O (√n) approximation and integrality gap for disjoint paths and UFP. Theory Comput 2:137–146
Chekuri C, Khanna S, Shepherd FB (2007) A note on multiflows and treewidth. Algorithmica. Published online
Frank A (1990) Packing paths, cuts, and circuits – a survey. In: Korte B, Lovász L, Prömel HJ, Schrijver A (eds) Paths, flows and VLSI-layout. Springer, Berlin, pp 49–100
Garg N, Vazirani V, Yannakakis M (1997) Primal-dual approximation algorithms for integral flow and multicut in trees. Algorithmica 18(1):3–20, Preliminary version appeared in Proceedings of the ICALP 1993
Guruswami V, Khanna S, Rajaraman R, Shepherd FB, Yannakakis M (2003) Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems. J Comput Syst Sci 67:473–496, Preliminary version in Proceedings of the ACM STOC 1999
Kleinberg JM (1996) Approximation algorithms for disjoint paths problems. PhD thesis, MIT, Cambridge, MA
Kleinberg JM (2005) An approximation algorithm for the disjoint paths problem in even-degree planar graphs. In: Proceedings of the IEEE FOCS, pp 627–636
Kolliopoulos SG (2007) Edge disjoint paths and unsplittable flow. In: Handbook on approximation algorithms and metaheuristics. Chapman & Hall/CRC Press computer & science series, vol 13. Chapman Hall/CRC Press
Kolliopoulos SG, Stein C (2004) Approximating disjoint-path problems using greedy algorithms and packing integer programs. Math Program A 99:63–87, Preliminary version in Proceedings of the IPCO 1998
Robertson N, Seymour PD (1995) Graph minors XIII. The disjoint paths problem. J Comb Theory B 63(1):65–110
Schrijver A (2003) Combinatorial optimization: polyhedra and efficiency. Springer, Berlin
Srinivasan A (1997) Improved approximations for edge-disjoint paths, unsplittable flow, and related routing problems. In: Proceedings of the IEEE FOCS, pp 416–425
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer Science+Business Media New York
About this entry
Cite this entry
Chekuri, C. (2016). Multicommodity Flow, Well-linked Terminals and Routing Problems. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_244
Download citation
DOI: https://doi.org/10.1007/978-1-4939-2864-4_244
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4939-2863-7
Online ISBN: 978-1-4939-2864-4
eBook Packages: Computer ScienceReference Module Computer Science and Engineering