Skip to main content
SpringerLink
Log in

Mehrgüterflüsse und kantendisjunkte Wege

  • Chapter
Kombinatorische Optimierung

  • 3511 Accesses

Zusammenfassung

Das MULTICOMMODITY-FLOW-PROBLEM ist eine Verallgemeinerung des MAXIMUM-FLOW-PROBLEMS. In einem gegebenen Digraphen mit Kantenkapazitäten möchten wir nun einen s-t-Fluss für mehrere Paare (s,t) finden (wir sprechen hier von mehreren Gütern), so dass der Gesamtfluss durch jede Kante deren Kapazität nicht übersteigt. Die Paare (s,t) stellen wir in einem zweiten Graphen dar; technisch bedingt repräsentieren wir einen s-t-Fluss durch eine Kante von t nach s.

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

Access this chapter

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 44.99
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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literatur

Allgemeine Literatur

  • Frank, A.: 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, S. 47–100

    Google Scholar 

  • Ripphausen-Lipa, H., Wagner, D., und Weihe, K.: 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.: Combinatorial Optimization: Polyhedra and Efficiency. Springer, Berlin 2003, Kapitel 70–76

    MATH  Google Scholar 

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

    Google Scholar 

Zitierte Literatur

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

    Article  MATH  MathSciNet  Google Scholar 

  • Bienstock, D., und Iyengar, G.: Solving fractional packing problems in O∗(1) iterations. SIAM Journal on Computing 35 (2006), 825–854

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  • Chekuri, C., und Khanna, S.: Edge-disjoint paths revisited. ACM Transactions on Algorithms 3 (2007), Article 46

    Google Scholar 

  • Chudak, F.A., und Eleutério, V.: 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, S. 81–96

    Google Scholar 

  • Even, S., Itai, A., und Shamir, A.: 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.: 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., und Fulkerson, D.R.: A suggested computation for maximal multicommodity network flows. Management Science 5 (1958), 97–101

    MATH  MathSciNet  Google Scholar 

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

    MATH  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Google Scholar 

  • Garg, N., und Könemann, J.: Faster and simpler algorithms for multicommodity flow and other fractional packing problems. SIAM Journal on Computing 37 (2007), 630–652

    Article  MATH  MathSciNet  Google Scholar 

  • Grigoriadis, M.D., und Khachiyan, L.G.: Coordination complexity of parallel pricedirective decomposition. Mathematics of Operations Research 21 (1996), 321–340

    Article  MATH  MathSciNet  Google Scholar 

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

    MATH  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  • Karakostas, G.: 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.: Reducibility among combinatorial problems. In: Complexity of Computer Computations (R.E. Miller, J.W. Thatcher, eds.), Plenum Press, New York 1972, S. 85–103

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  • Kleinberg, J.: Approximation algorithms for disjoint paths problems. PhD thesis, MIT, Cambridge 1996

    Google Scholar 

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

    Google Scholar 

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

    Article  MATH  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Google Scholar 

  • Nishizeki, T., Vygen, J., und Zhou, X.: 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., und Seymour, P.D.: Multicommodity flows in planar graphs. Journal of Combinatorial Theory B 31 (1981), 75–81

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    MATH  MathSciNet  Google Scholar 

  • Scheffler, P.: 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.: On odd cuts and multicommodity flows. Proceedings of the London Mathematical Society (3) 42 (1981), 178–192

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  • Shmoys, D.B.: 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.: NP-completeness of some edge-disjoint paths problems. Discrete Applied Mathematics 61 (1995), 83–90

    Article  MATH  MathSciNet  Google Scholar 

  • Vygen, J.: 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, S. 308–324

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  • Young, N.: 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). Mehrgüterflüsse und kantendisjunkte Wege. In: Kombinatorische Optimierung. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-76919-4_19

Download citation

Publish with us

Policies and ethics

Search

Navigation