Improved bounds on the max-flow min-cut ratio for multicommodity flows

Abstract

In this paper we consider the worst case ratio between the capacity of min-cuts and the value of max-flow for multicommodity flow problems. We improve the best known bounds for the min-cut max-flow ratio for multicommodity flows in undirected graphs, by replacing theO(logD) in the bound byO(logk), whereD denotes the sum of all demands, andk demotes the number of commodities. In essence we prove that up to constant factors the worst min-cut max-flow ratios appear in problems where demands are integral and polynomial in the number of commodities.

Klein, Rao, Agrawal, and Ravi have previously proved that if the demands and the capacities are integral, then the min-cut max-flow ratio in general undirected graphs is bounded byO(logClogD), whereC denotes the sum of all the capacities. Tragoudas has improved this bound toO(lognlogD), wheren is the number of nodes in the network. Garg, Vazirani and Yannakakis further improved this toO(logklogD). Klein, Plotkin and Rao have proved that for planar networks, the ratio isO(logD).

Our result improves the bound for general networks toO(log2 k) and the bound for planar networks toO(logk). In both cases our result implies the first non-trivial bound that is independent of the magnitude of the numbers involved. The method presented in this paper can be used to give polynomial time approximation algorithms to the minimum cuts in the network up to the above factors.

This is a preview of subscription content, access via your institution.

References

  1. [1]

    B. Awerbuch andT. Leighton: Improved approximation algorithms for the multicommodity flow problem and local competitive routing in dynamic networks, InProc. 26th Annual ACM Symposium on Theory of Computing, 487–495, 1994.

  2. [2]

    G. Even, J. Naor, B. Schieber, andM. Sudan: Approximating minimum feedback sets and multi-cuts in directed graphs. Unpublished manuscript, May 1994.

  3. [3]

    L. R. Ford, Jr. andD. R. Fulkerson:Flows in Networks, Princeton Univ. Press, Princeton, NJ, 1962.

    Google Scholar 

  4. [4]

    N. Garg, V. V. Vazirani, andM. Yannakakis: Approximate max-flow min-(multi)cut theorems and their applications, InProc. 25th Annual ACM Symposium on Theory of Computing, May 1993.

  5. [5]

    P. Klein, S. Plotkin, andS. Rao: Planar graphs, multicommodity flow, and network decomposition, InProc. 25th Annual ACM Symposium on Theory of Computing, May 1993.

  6. [6]

    P. Klein, S. Plotkin, S. Rao, andÉ. Tardos: Bounds on the max-flow min-cut ratio for directed multicommodity flows, Technical Report CS-93-30, Brown University, September 1993.

  7. [7]

    P. N. Klein, S. Rao, A. Agrawal, andR. Ravi: An approximate max-flow min-cut relation for multicommodity flow, with applications,Combinatorica,15 (2) (1995), 187–202. Preliminary version appeared as “Approximation through multicommodity flow,” InProc. 31th IEEE Annual Symposium on Foundations of Computer Science, 726–737, 1990.

    Google Scholar 

  8. [8]

    T. Leighton, F. Makedon, S. Plotkin, C. Stein, É. Tardos, andS. Tragoudas: Fast approximation algorithms for multicommodity flow problem, InProc. 23th ACM Symposium on the Theory of Computing, 101–111, May 1991.

  9. [9]

    T. Leighton andS. Rao: An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms, InProc. 29th IEEE Annual Symposium on Foundations of Computer Science, 422–431, 1988.

  10. [10]

    H. Okamura andP. D. Seymour: Multicommodity flows in planar graphs,J. Comb. Theory (B),31 75–81, 1981.

    Google Scholar 

  11. [11]

    P. D. Seymour: Matroids and multicommodity flows,European Journal of Combinatorics,2 257–290, 1981.

    Google Scholar 

  12. [12]

    P. D. Seymour: Packing directed circuits fractionally,Combinatorica,15 (2) (1995), 281–288.

    Google Scholar 

  13. [13]

    S. Tragoudas: Improved approximations for the min-cut ratio and the flux,Mathematical Systems Theory, to appear.

  14. [14]

    S. Tragoudas:VLSI partitioning approximation algorithms based on multicommodity flow and other techniques, PhD thesis, University of Texas at Dallas, 1991.

Download references

Author information

Affiliations

Authors

Additional information

Preliminary version appeared in Proceedings of the 25th Annual ACM Symposium on the Theory of Computing, 1993, 691-697.

Research supported by U.S. Army Research Office Grant DAAL-03-91-G-0102, and by a grant from Mitsubishi Electric Laboratories.

Research supported in part by a Packard Fellowship, an NSF PYI award, a Sloan Fellowship, and by the National Science Foundation, the Air Force Office of Scientific Research, and the Office of Naval Research, through NSF grant DMS-8920550.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Plotkin, S., Tardos, É. Improved bounds on the max-flow min-cut ratio for multicommodity flows. Combinatorica 15, 425–434 (1995). https://doi.org/10.1007/BF01299746

Download citation

Mathematics Subject Classification (1991)

  • 68 Q 25
  • 68 R 10