Skip to main content
Springer Nature Link
Log in

Multicommodity Flow, Well-linked Terminals and Routing Problems

  • Reference work entry
  • First Online:
Encyclopedia of Algorithms

  • 207 Accesses

Years and Authors of Summarized Original Work

  • 2005; Chekuri, Khanna, Shepherd

Problem Definition

Three related optimization problems derived from the classical edge disjoint paths problem (EDP) are described. An instance of EDP consists of an undirected graph \( G=(V,E) \) and a multiset \( \mathcal{T} = \{s_1 t_1, s_2 t_2, \dots, s_k t_k\} \) of k node pairs. EDP is a decision problem: can the pairs in \( \mathcal{T} \) be connected (alternatively routed) via edge-disjoint paths? In other words, are there paths \( P_1, P_2, \dots, P_k \) such that for \( 1 \le i \le k, P_i \) is path from s i to t i , and no edge \( e \in E \) is in more than one of these paths? EDP is known to be NP-Complete. This article considers there maximization problems related to EDP.

  • Maximum Edge-Disjoint Paths Problem (MEDP). Input to MEDP is the same as for EDP. The objective is to maximize the number of pairs in \( \mathcal{T} \) that can be routed via edge-disjoint paths. The output consists of a subset \(...

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Recommended Reading

  1. 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

    Google Scholar 

  2. 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

    Article  MathSciNet  MATH  Google Scholar 

  3. Chekuri C, Khanna S, Shepherd FB (2004) Edge-disjoint paths in Planar graphs. In: Proceedings of the IEEE FOCS, pp 71–80

    Google Scholar 

  4. Chekuri C, Khanna S, Shepherd FB (2004) The all-or-nothing multicommodity flow problem. In: Proceedings of the ACM STOC, pp 156–165

    Google Scholar 

  5. Chekuri C, Khanna S, Shepherd FB (2005) Multicommodity flow, well-linked terminals, and routing problems. In: Proceedings of the ACM STOC, pp 183–192

    Google Scholar 

  6. 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

    Google Scholar 

  7. Chekuri C, Khanna S, Shepherd FB (2006) An O (√n) approximation and integrality gap for disjoint paths and UFP. Theory Comput 2:137–146

    Article  MathSciNet  MATH  Google Scholar 

  8. Chekuri C, Khanna S, Shepherd FB (2007) A note on multiflows and treewidth. Algorithmica. Published online

    Google Scholar 

  9. 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

    Google Scholar 

  10. 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

    Article  MathSciNet  MATH  Google Scholar 

  11. 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

    Article  MathSciNet  MATH  Google Scholar 

  12. Kleinberg JM (1996) Approximation algorithms for disjoint paths problems. PhD thesis, MIT, Cambridge, MA

    Google Scholar 

  13. 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

    Google Scholar 

  14. 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

    Google Scholar 

  15. 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

    Article  MathSciNet  MATH  Google Scholar 

  16. Robertson N, Seymour PD (1995) Graph minors XIII. The disjoint paths problem. J Comb Theory B 63(1):65–110

    Article  MathSciNet  MATH  Google Scholar 

  17. Schrijver A (2003) Combinatorial optimization: polyhedra and efficiency. Springer, Berlin

    MATH  Google Scholar 

  18. Srinivasan A (1997) Improved approximations for edge-disjoint paths, unsplittable flow, and related routing problems. In: Proceedings of the IEEE FOCS, pp 416–425

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Illinois, Urbana-Champaign, Urbana, IL, USA

    Chandra Chekuri

  2. Department of Mathematics and Computer Science, The Open University of Israel, Raanana, Israel

    Chandra Chekuri

Authors
  1. Chandra Chekuri
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL, USA

    Ming-Yang Kao

Rights and permissions

Reprints 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

Publish with us

Policies and ethics