Multicut in General Graphs

  • Vijay V. Vazirani


The importance of min-max relations to combinatorial optimization was mentioned in Chapter 1. Perhaps the most useful of these is the celebrated max-flow min-cut theorem. Indeed, much of flow theory, and the theory of cuts in graphs, has been built around this theorem. It is not surprising, therefore, that a concerted effort was made to obtain generalizations of this theorem to the case of multiple commodities.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 103.
    N. Garg, V.V. Vazirani, and M. Yannakakis. Approximate max-flow min(multi)cut theorems and their applications. SIAM Journal on Computing, 25: 235–251, 1996.MathSciNetCrossRefGoogle Scholar
  2. 180.
    P. Klein, S. Rao, A. Agrawal, and R. Ravi. An approximate max-flow min-cut relation for undirected multicommodity flow, with applications. Combinatorica, 15: 187–202, 1995.MathSciNetCrossRefGoogle Scholar
  3. 228.
    M. Pinsker. On the complexity of a concentrator. In Proc. 7th Annual Teletraffic Conference, pages 318/1–318/4, 1973.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Vijay V. Vazirani
    • 1
  1. 1.Georgia Institute of TechnologyCollege of ComputingAtlantaUSA

Personalised recommendations