Advertisement

A New Min-Cut Max-Flow Ratio for Multicommodity Flows

  • Oktay Günlük
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2337)

Abstract

We present an improved bound on the min-cut max-flow ratio for multicommodity flow problems with specified demands. To obtain the numerator of this ratio, capacity of a cut is scaled by the demand that has to cross the cut. In the denominator, the maximum concurrent flow value is used. Our new bound is proportional to log(k*) where k* is the cardinality of the minimal vertex cover of the demand graph.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Y. Aumann and Y. Rabani: Approximate min-cut max-flow theorem and approximation algorithm. SIAM Journal on Computing 27 (1998) 291–301MathSciNetzbMATHCrossRefGoogle Scholar
  2. 2.
    D. Bienstock and O. Günlük: Computational experience with a difficult multicommodity flow problem. Mathematical Programming 68 (1995) 213–238MathSciNetzbMATHGoogle Scholar
  3. 3.
    J. Bourgain: On Lipschitz embedding of finite metric spaces in Hilbert space. Israel Journal of Mathematics 52 (1985) 46–52MathSciNetzbMATHCrossRefGoogle Scholar
  4. 4.
    ”P. Fishburn and P. Hammer: Bipartite dimensions and bipartite degrees of graphs. Discrete Math. 160 (1996) 127–148MathSciNetzbMATHCrossRefGoogle Scholar
  5. 5.
    L. R. Ford Jr. and D. R. Fulkerson: Flows in Networks. Princeton University Press (1962)Google Scholar
  6. 6.
    N. Garg, V.V. Vazirani and M. Yannakakis: Approximate max-flow min-(multi)cut theorems and their applications. in Proceedings of the 25th Annual ACM Symposium on Theory of Computing (1993) 698–707Google Scholar
  7. 7.
    M. Iri: On an extension of the max-flow min-cut theorem to multicommodity flows. Journal of the Operations Research Society of Japan 13 (1971) 129–135MathSciNetzbMATHGoogle Scholar
  8. 8.
    W. Johnson and J. Lindenstrauss: Extensions of Lipschitz mappings into a Hilbert space. Contemporary Mathematics 26 (1984) 189–206MathSciNetzbMATHCrossRefGoogle Scholar
  9. 9.
    A. V. Karzanov: Polyhedra related to undirected multicommodity flows. Linear Algebra and its Applications 114 (1989) 293–328MathSciNetCrossRefGoogle Scholar
  10. 10.
    P. Klein, S. Rao, A. Agrawal, and R. Ravi: An approximate max-flow min-cut relation for undirected multicommodity flow with applications. Combinatorica 15 (1995) 187–202MathSciNetzbMATHCrossRefGoogle Scholar
  11. 11.
    F.T. Leighton and S. Rao: An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms. in Proceedings of the 29th Annual IEEE Symposium on Foundations of Computer Science (1988) 422–431Google Scholar
  12. 12.
    N. Linial, E. London, and Y. Rabinovich (1995): The geometry of graphs and some of its algorithmic applications. Combinatorica 15 215–245MathSciNetzbMATHCrossRefGoogle Scholar
  13. 13.
    C. Lund, S. Phillips and N. Reingold: Private communicationGoogle Scholar
  14. 14.
    D. W. Matula: Concurrent flow and concurrent connectivity in graphs. in Graph Theory and its Applications to Algorithms and Computer Science Wiley New York (1985) 543–559Google Scholar
  15. 15.
    R. Motwani and P. Raghavan: Randomized Algorithms. Cambridge University Press Cambridge (1995)zbMATHCrossRefGoogle Scholar
  16. 16.
    H. Okamura and P. Seymour: Multicommodity flows in planar graphs. Journal of Comput. Theory-Ser. B 31 (1981) 75–81MathSciNetzbMATHCrossRefGoogle Scholar
  17. 17.
    K. Onaga, and O. Kakusho: On feasibility conditions of multicommodity flows in networks. IEEE Transactions on Circuit Theory CT-18 4 (1971) 425–429MathSciNetCrossRefGoogle Scholar
  18. 18.
    G. Pisier: The Volume of Convex Bodies and Banach Space Geometry. Cambridge University Press Cambridge (1989)zbMATHCrossRefGoogle Scholar
  19. 19.
    S. Plotkin and E. Tardos: Improved Bounds on the max-flow min-cut ratio for multicommodity flows. Proceedings 25’th Symposium on Theory of Computing (1993)Google Scholar
  20. 20.
    F. Shahrokhi and D. W. Matula: The maximum concurrent flow problem. Journal of Association for Computing Machinery 37 (1990) 318–334MathSciNetzbMATHCrossRefGoogle Scholar
  21. 21.
    S. Tragoudas: Improved approximations for the min-cut max-flow ratio and the flux. Mathematical Systems Theory 29 (1996) 157–167MathSciNetzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Oktay Günlük
    • 1
  1. 1.Math. Sci. Dept.IBM ResearchYorktown Heights

Personalised recommendations