Skip to main content
SpringerLink
Log in
Book cover

Combinatorial Optimization pp 467–489Cite as

Multicommodity Flows and Edge-Disjoint Paths

  • Chapter

  • 4104 Accesses

Part of the book series: Algorithms and Combinatorics ((AC,volume 21))

Abstract

The Multicommodity Flow Problem is a generalization of the Maximum Flow Problem. Given a digraph with edge capacities, we now ask for an s-t-flow for several pairs (s, t) (we speak of several commodities), such that the total flow through any edge does not exceed the capacity. We specify the pairs (s, t) by a second digraph; for technical reasons we have an edge from t to s when we ask for an s-t-flow. Formally we have:

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   69.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   89.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

General Literature

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

    Google Scholar 

  • Ripphausen-Lipa, H., Wagner, D., and Weihe, K. [1995]: Efficient algorithms for disjoint paths in planar graphs. In: Combinatorial Optimization; DIMACS Series in Discrete Mathematics and Theoretical Computer Science 20 (W. Cook, L. Lovász, P. Seymour, eds.), AMS, Providence 1995

    Google Scholar 

  • Schrijver, A. [2003]: Combinatorial Optimization: Polyhedra and Efficiency. Springer, Berlin 2003, Chapters 70–76

    MATH  Google Scholar 

  • Vygen, J. [1994]: Disjoint Paths. Report No. 94816, Research Institute for Discrete Mathematics, University of Bonn, 1994

    Google Scholar 

Cited References

  • Becker, M., and Mehlhorn, K. [1986]: Algorithms for routing in planar graphs. Acta Informatica 23 (1986), 163–176

    Article  MATH  MathSciNet  Google Scholar 

  • Bienstock, D., and Iyengar, G. [2006]: Solving fractional packing problems in \( O*(\frac{1} {\varepsilon }) \) iterations. SIAM Journal on Computing 35 (2006), 825–854

    Article  MATH  MathSciNet  Google Scholar 

  • Boesch, F., and Tindell, R. [1980]: Robbins’s theorem for mixed multigraphs. American Mathematical Monthly 87 (1980), 716–719

    Article  MATH  MathSciNet  Google Scholar 

  • Chudak, F.A., and Eleutéerio, V. [2005]: Improved approximation schemes for linear programming relaxations of combinatorial optimization problems. In: Integer Programming and Combinatorial Optimization; Proceedings of the 11th International IPCO Conference; LNCS 3509 (M. Jünger, V. Kaibel, eds.), Springer, Berlin 2005, pp. 81–96

    Google Scholar 

  • Even, S., Itai, A., and Shamir, A. [1976]: On the complexity of timetable and multicommodity flow problems. SIAM Journal on Computing 5 (1976), 691–703

    Article  MATH  MathSciNet  Google Scholar 

  • Fleischer, L.K. [2000]: Approximating fractional multicommodity flow independent of the number of commodities. SIAM Journal on Discrete Mathematics 13 (2000), 505–520

    Article  MATH  MathSciNet  Google Scholar 

  • Ford, L.R., and Fulkerson, D.R. [1958]: A suggested computation for maximal multicommodity network flows. Management Science 5 (1958), 97–101

    Article  MATH  MathSciNet  Google Scholar 

  • Ford, L.R., and Fulkerson, D.R. [1962]: Flows in Networks. Princeton University Press, Princeton 1962

    MATH  Google Scholar 

  • Fortune, S., Hopcroft, J., and Wyllie, J. [1980]: The directed subgraph homeomorphism problem. Theoretical Computer Science 10 (1980), 111–121

    Article  MATH  MathSciNet  Google Scholar 

  • Frank, A. [1980]: On the orientation of graphs. Journal of Combinatorial Theory B 28 (1980), 251–261

    Article  MATH  Google Scholar 

  • Frank, A. [1981]: How to make a digraph strongly connected. Combinatorica 1 (1981), 145–153

    Article  MATH  MathSciNet  Google Scholar 

  • Frank, A., and Tardos, É. [1984]: Matroids from crossing families. In: Finite and Infinite Sets; Vol. I (A. Hajnal, L. Lovász, and V.T. Sós, eds.), North-Holland, Amsterdam, 1984, pp. 295–304

    Google Scholar 

  • Garg, N., and Könemann, J. [1998]: Faster and simpler algorithms for multicommodity flow and other fractional packing problems. Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science (1998), 300–309

    Google Scholar 

  • Grigoriadis, M.D., and Khachiyan, L.G. [1996]: Coordination complexity of parallel price-directive decomposition. Mathematics of Operations Research 21 (1996), 321–340

    MATH  MathSciNet  Google Scholar 

  • Hu, T.C. [1963]: Multi-commodity network flows. Operations Research 11 (1963), 344–360

    MATH  Google Scholar 

  • Ibaraki, T., and Poljak, S. [1991]: Weak three-linking in Eulerian digraphs. SIAM Journal on Discrete Mathematics 4 (1991), 84–98

    Article  MATH  MathSciNet  Google Scholar 

  • Karakostas, G. [2002]: Faster approximation schemes for fractional multicommodity flow problems. Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (2002), 166–173

    Google Scholar 

  • Karp, R.M. [1972]: Reducibility among combinatorial problems. In: Complexity of Computer Computations (R.E. Miller, J.W. Thatcher, eds.), Plenum Press, New York 1972, pp. 85–103

    Google Scholar 

  • Karzanov, A.V. [1987]: Half-integral five-terminus-flows. Discrete Applied Mathematics 18 (1987) 263–278

    Article  MATH  MathSciNet  Google Scholar 

  • Lomonosov, M. [1979]: Multiflow feasibility depending on cuts. Graph Theory Newsletter 9 (1979), 4

    Google Scholar 

  • Lovász, L. [1976]: On two minimax theorems in graph. Journal of Combinatorial Theory B 21 (1976), 96–103

    Article  MATH  Google Scholar 

  • Lucchesi, C.L., and Younger, D.H. [1978]: A minimax relation for directed graphs. Journal of the London Mathematical Society II 17 (1978), 369–374

    Article  MathSciNet  Google Scholar 

  • Matsumoto, K., Nishizeki, T., and Saito, N. [1986]: Planar multicommodity flows, maximum matchings and negative cycles. SIAM Journal on Computing 15 (1986), 495–510

    Article  MATH  MathSciNet  Google Scholar 

  • Middendorf, M., and Pfeiffer, F. [1993]: On the complexity of the disjoint path problem. Combinatorica 13 (1993), 97–107

    Article  MATH  MathSciNet  Google Scholar 

  • Nash-Williams, C.S.J.A. [1969]: Well-balanced orientations of finite graphs and unobtrusive odd-vertex-pairings. In: Recent Progress in Combinatorics (W. Tutte, ed.), Academic Press, New York 1969, pp. 133–149

    Google Scholar 

  • Nishizeki, T., Vygen, J., and Zhou, X. [2001]: The edge-disjoint paths problem is NP-complete for series-parallel graphs. Discrete Applied Mathematics 115 (2001), 177–186

    Article  MATH  MathSciNet  Google Scholar 

  • Okamura, H., and Seymour, P.D. [1981]: Multicommodity flows in planar graphs. Journal of Combinatorial Theory B 31 (1981), 75–81

    Article  MATH  MathSciNet  Google Scholar 

  • Raghavan, P., and Thompson, C.D. [1987]: Randomized rounding: a technique for provably good algorithms and algorithmic proofs. Combinatorica 7 (1987), 365–374

    Article  MATH  MathSciNet  Google Scholar 

  • Robertson, N., and Seymour, P.D. [1986]: Graph minors VI; Disjoint paths across a disc. Journal of Combinatorial Theory B 41 (1986), 115–138

    Article  MATH  MathSciNet  Google Scholar 

  • Robertson, N., and Seymour, P.D. [1995]: Graph minors XIII; The disjoint paths problem. Journal of Combinatorial Theory B 63 (1995), 65–110

    Article  MATH  MathSciNet  Google Scholar 

  • Rothschild, B., and Whinston, A. [1966]: Feasibility of two-commodity network flows. Operations Research 14 (1966), 1121–1129

    MATH  MathSciNet  Google Scholar 

  • Scheffler, P. [1994]: A practical linear time algorithm for disjoint paths in graphs with bounded tree-width. Technical Report No. 396/1994, FU Berlin, Fachbereich 3 Mathematik

    Google Scholar 

  • Seymour, P.D. [1981]: On odd cuts and multicommodity flows. Proceedings of the London Mathematical Society (3) 42 (1981), 178–192

    Article  MATH  MathSciNet  Google Scholar 

  • Shahrokhi, F., and Matula, D.W. [1990]: The maximum concurrent flow problem. Journal of the ACM 37 (1990), 318–334

    Article  MATH  MathSciNet  Google Scholar 

  • Shmoys, D.B. [1996]: Cut problems and their application to divide-and-conquer. In: Approximation Algorithms for NP-Hard Problems (D.S. Hochbaum, ed.), PWS, Boston, 1996

    Google Scholar 

  • Vygen, J. [1995]: NP-completeness of some edge-disjoint paths problems. Discrete Applied Mathematics 61 (1995), 83–90

    Article  MATH  MathSciNet  Google Scholar 

  • Vygen, J. [2004]: Near-optimum global routing with coupling, delay bounds, and power consumption. In: Integer Programming and Combinatorial Optimization; Proceedings of the 10th International IPCO Conference; LNCS 3064 (G. Nemhauser, D. Bienstock, eds.), Springer, Berlin 2004, pp. 308–324

    Google Scholar 

  • Wagner, D., and Weihe, K. [1995]: A linear-time algorithm for edge-disjoint paths in planar graphs. Combinatorica 15 (1995), 135–150

    Article  MATH  MathSciNet  Google Scholar 

  • Young, N. [1995]: Randomized rounding without solving the linear program. Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms (1995), 170–178

    Google Scholar 

Download references

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

(2008). Multicommodity Flows and Edge-Disjoint Paths. In: Combinatorial Optimization. Algorithms and Combinatorics, vol 21. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71844-4_19

Download citation

Publish with us

Policies and ethics

Search

Navigation