Skip to main content
SpringerLink
Log in
Book cover

Efficient Approximation and Online Algorithms pp 97–134Cite as

Approximation Algorithms for Edge-Disjoint Paths and Unsplittable Flow

  • Chapter

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3484))

Abstract

In the maximum edge-disjoint paths problem (MEDP) the input consists of a graph and a set of requests (pairs of vertices), and the goal is to connect as many requests as possible along edge-disjoint paths. We give a survey of known results about the complexity and approximability of MEDP and sketch some of the main ideas that have been used to obtain approximation algorithms for the problem. We consider also the generalization of MEDP where the edges of the graph have capacities and each request has a profit and a demand, called the unsplittable flow problem.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aumann, Y., Rabani, Y.: Improved bounds for all optical routing. In: Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1995), pp. 567–576 (1995)

    Google Scholar 

  2. Awerbuch, B., Azar, Y., Fiat, A., Leonardi, S., Rosén, A.: On-line competitive algorithms for call admission in optical networks. Algorithmica 31(1), 29–43 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  3. Awerbuch, B., Gawlick, R., Leighton, T., Rabani, Y.: On-line admission control and circuit routing for high performance computing and communication. In: Proceedings of the 35th Annual Symposium on Foundations of Computer Science (FOCS 1994), pp. 412–423 (1994)

    Google Scholar 

  4. Azar, Y., Regev, O.: Strongly polynomial algorithms for the unsplittable flow problem. In: Aardal, K., Gerards, B. (eds.) IPCO 2001. LNCS, vol. 2081, pp. 15–29. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  5. Baveja, A., Srinivasan, A.: Approximation algorithms for disjoint paths and related routing and packing problems. Mathematics of Operations Research 25(2), 255–280 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  6. Blum, A., Kalai, A., Kleinberg, J.: Admission control to minimize rejections. In: Dehne, F., Sack, J.-R., Tamassia, R. (eds.) WADS 2001. LNCS, vol. 2125, pp. 155–164. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  7. Bodlaender, H.L.: A tourist guide through treewidth. Acta Cybernetica 11, 1–21 (1993)

    MATH  MathSciNet  Google Scholar 

  8. Bodlaender, H.L.: A partial k-arboretum of graphs with bounded treewidth. Theoretical Computer Science 209, 1–45 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  9. Bohman, T., Frieze, A.: Arc-disjoint paths in expander digraphs. In: Proceedings of the 42nd Annual Symposium on Foundations of Computer Science (FOCS 2001), pp. 558–567 (2001)

    Google Scholar 

  10. Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)

    MATH  Google Scholar 

  11. Broder, A.Z., Frieze, A.M., Suen, S., Upfal, E.: Optimal construction of edge-disjoint paths in random graphs. SIAM J. Comput. 28(2), 541–573 (1999)

    Article  MathSciNet  Google Scholar 

  12. Broder, A.Z., Frieze, A.M., Upfal, E.: Existence and construction of edge-disjoint paths on expander graphs. SIAM J. Comput. 23(5), 976–989 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  13. Carmi, P., Erlebach, T., Okamoto, Y.: Greedy edge-disjoint paths in complete graphs. In: Bodlaender, H.L. (ed.) WG 2003. LNCS, vol. 2880, pp. 143–155. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  14. Chakrabarti, A., Chekuri, C., Gupta, A., Kumar, A.: Approximation algorithms for the unsplittable flow problem. In: Jansen, K., Leonardi, S., Vazirani, V.V. (eds.) APPROX 2002. LNCS, vol. 2462, pp. 51–66. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  15. Chekuri, C., Khanna, S.: Edge disjoint paths revisited. In: Proceedings of the 14th Annual ACM–SIAM Symposium on Discrete Algorithms (SODA 2003), pp. 628–637 (2003)

    Google Scholar 

  16. Chekuri, C., Mydlarz, M., Shepherd, F.: Multicommodity demand flow in a tree. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 410–425. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  17. Cornuejols, G., Fisher, M.L., Nemhauser, G.L.: Location of bank accounts to optimize float: An analytic study of exact and approximate algorithms. Management Science 23(8), 789–810 (1977)

    Article  MATH  MathSciNet  Google Scholar 

  18. Dinitz, Y., Garg, N., Goemans, M.X.: On the single source unsplittable flow problem. Combinatorica, 1–25 (1999)

    Google Scholar 

  19. Erlebach, T.: Scheduling Connections in Fast Networks. PhD thesis, Technische Universität München (1999)

    Google Scholar 

  20. Erlebach, T.: Approximation algorithms and complexity results for path problems in trees of rings. In: Sgall, J., Pultr, A., Kolman, P. (eds.) MFCS 2001. LNCS, vol. 2136, pp. 351–362. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  21. Erlebach, T., Jansen, K.: The maximum edge-disjoint paths problem in bidirected trees. SIAM Journal on Discrete Mathematics 14(3), 326–355 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  22. Erlebach, T., Vukadinović, D.: New results for path problems in generalized stars, complete graphs, and brick wall graphs. In: Freivalds, R. (ed.) FCT 2001. LNCS, vol. 2138, pp. 483–494. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  23. Fortune, S., Hopcroft, J., Wyllie, J.: The directed subgraph homeomorphism problem. Theoretical Computer Science 10(2), 111–121 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  24. Frank, A.: Packing paths, circuits, and cuts – a survey. In: Korte, B., Lovász, L., Prömel, H.J., Schrijver, A. (eds.) Paths, Flows, and VLSI-Layout, pp. 47–100. Springer, Berlin (1990)

    Google Scholar 

  25. Frieze, A.M.: Edge-disjoint paths in expander graphs. SIAM J. Comput. 30, 1790–1801 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  26. Frieze, A.M., Zhao, L.: Optimal construction of edge-disjoint paths in random regular graphs. Combinatorics, Probability and Computing 9, 241–264 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  27. Garey, M.R., Johnson, D.S.: Computers and Intractability. A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York-San Francisco (1979)

    MATH  Google Scholar 

  28. Garg, N., Vazirani, V.V., Yannakakis, M.: Primal-dual approximation algorithms for integral flow and multicut in trees. Algorithmica 18(1), 3–20 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  29. Gu, Q.-P., Tamaki, H.: Routing a permutation in the hypercube by two sets of edge disjoint paths. Journal of Parallel and Distributed Computing 44(2), 147–152 (1997)

    Article  MATH  Google Scholar 

  30. Gupta, U.I., Lee, D.T., Leung, J.Y.-T.: Efficient algorithms for interval graphs and circular-arc graphs. Networks 12, 459–467 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  31. Guruswami, V., Khanna, S., Rajaraman, R., Shepherd, B., Yannakakis, M.: Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems. In: Proceedings of the 31st Annual ACM Symposium on Theory of Computing (STOC 1999), pp. 19–28 (1999)

    Google Scholar 

  32. Håstad, J.: Clique is hard to approximate within n 1 − ε. In: Proceedings of the 37th Annual Symposium on Foundations of Computer Science (FOCS 1996), pp. 627–636 (1996)

    Google Scholar 

  33. Kleinberg, J.: Approximation algorithms for disjoint paths problems. PhD thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology (1996)

    Google Scholar 

  34. Kleinberg, J., Rubinfeld, R.: Short paths in expander graphs. In: Proceedings of the 37th Annual Symposium on Foundations of Computer Science (FOCS 1996), pp. 86–95 (1996)

    Google Scholar 

  35. Kleinberg, J., Tardos, É.: Approximations for the disjoint paths problem in high-diameter planar networks. In: Proceedings of the 27th Annual ACM Symposium on Theory of Computing (STOC 1995), pp. 26–35 (1995)

    Google Scholar 

  36. Kleinberg, J., Tardos, É.: Disjoint paths in densely embedded graphs. In: Proceedings of the 36th Annual Symposium on Foundations of Computer Science (FOCS 1995), pp. 52–61 (1995)

    Google Scholar 

  37. Kolliopoulos, S.G., Stein, C.: Approximating disjoint-path problems using greedy algorithms and packing integer programs. In: Bixby, R.E., Boyd, E.A., Ríos-Mercado, R.Z. (eds.) IPCO 1998. LNCS, vol. 1412, pp. 153–168. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  38. Kolman, P.: Short disjoint paths on hypercubic graphs. Technical Report 2000-481, KAM-DIMATIA Series, Charles University, Prague (2000)

    Google Scholar 

  39. Kolman, P.: A note on the greedy algorithm for the unsplittable flow problem. Manuscript (December 2002)

    Google Scholar 

  40. Kolman, P., Scheideler, C.: Simple on-line algorithms for the maximum disjoint paths problem. In: Proceedings of the 13th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA 2001), pp. 38–47 (2001)

    Google Scholar 

  41. Kolman, P., Scheideler, C.: Improved bounds for the unsplittable flow problem. In: Proceedings of the 13th Annual ACM–SIAM Symposium on Discrete Algorithms (SODA 2002), pp. 184–193 (2002)

    Google Scholar 

  42. Kramer, M.E., van Leeuwen, J.: The complexity of wire routing and finding the minimum area layouts for arbitrary VLSI circuits. In: Preparata, F.P. (ed.) Advances in Computing Research; VLSI Theory, vol. 2, pp. 129–146. JAI Press Inc., Greenwich (1984)

    Google Scholar 

  43. Leighton, T., Rao, S.: Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. Journal of the ACM 46(6), 787–832 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  44. Leonardi, S.: On-line network routing. In: Fiat, A. (ed.) Online Algorithms: The State of the Art. LNCS, vol. 1442. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  45. Ma, B., Wang, L.: On the inapproximability of disjoint paths and minimum Steiner forest with bandwidth constraints. Journal of Computer and System Sciences 60, 1–12 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  46. Middendorf, M., Pfeiffer, F.: On the complexity of the disjoint paths problem. Combinatorica 13(1), 97–107 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  47. Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)

    MATH  Google Scholar 

  48. Nomikos, C.: Approximability of the path coloring problem. In: ASHCOMP Workshop, Udine (1996)

    Google Scholar 

  49. Nomikos, C., Pagourtzis, A., Zachos, S.: Minimizing request blocking in all-optical rings. In: Proceedings of the 22nd Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2003) (2003)

    Google Scholar 

  50. Raghavan, P., Thompson, C.D.: Randomized rounding: A technique for provably good algorithms and algorithmic proofs. Combinatorica 7(4), 365–374 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  51. Robertson, N., Seymour, P.: Graph Minors XIII: The disjoint paths problem. Journal of Combinatorial Theory Series B 63, 65–110 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  52. Scheideler, C.: Universal Routing Strategies for Interconnection Networks. LNCS, vol. 1390. Springer, Heidelberg (1998)

    Google Scholar 

  53. Schrijver, A.: Theory of linear and integer programming. John Wiley & Sons, Chichester (1986)

    MATH  Google Scholar 

  54. Skutella, M.: Approximating the single source unsplittable min-cost flow problem. Mathematical Programming Series B 91(3), 493–514 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  55. Srinivasan, A.: Improved approximations for edge-disjoint paths, unsplittable flow, and related routing problems. In: Proceedings of the 38th Annual Symposium on Foundations of Computer Science (FOCS 1997), pp. 416–425 (1997)

    Google Scholar 

  56. Varadarajan, K., Venkataraman, G.: Graph decomposition and a greedy algorithm for edge-disjoint paths. In: Proceedings of the 15th Annual ACM–SIAM Symposium on Discrete Algorithms (SODA 2004), pp. 379–380 (2004)

    Google Scholar 

  57. Vygen, J.: Disjoint paths. Technical Report 94816, Research Institute for Discrete Mathematics, University of Bonn (February 1994)

    Google Scholar 

  58. Wan, P.-J., Liu, L.: Maximal throughput in wavelength-routed optical networks. In: Multichannel Optical Networks: Theory and Practice. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 46, pp. 15–26. AMS (1998)

    Google Scholar 

  59. Zhou, X., Tamura, S., Nishizeki, T.: Finding edge-disjoint paths in partial k-trees. Algorithmica 26, 3–30 (2000)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Leicester, UK

    Thomas Erlebach

Authors
  1. Thomas Erlebach
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. IBISC, CNRS FRE 3190, Université d’Evry Val d’Essonne, Boulevard François Mitterand, 91025, Evry Cedex, France

    Evripidis Bampis

  2. Institute for Computer Science, University of Kiel, Olshausenstrasse 40, 24118, Kiel, Germany

    Klaus Jansen

  3. Brown University, 02918, Providence, RI, USA

    Claire Kenyon

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Erlebach, T. (2006). Approximation Algorithms for Edge-Disjoint Paths and Unsplittable Flow. In: Bampis, E., Jansen, K., Kenyon, C. (eds) Efficient Approximation and Online Algorithms. Lecture Notes in Computer Science, vol 3484. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11671541_4

Download citation

  • DOI: https://doi.org/10.1007/11671541_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-32212-2

  • Online ISBN: 978-3-540-32213-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation