Multicut and Integer Multicommodity Flow in Trees

  • Vijay V. Vazirani


The theory of cuts in graphs occupies a central place not only in the study of exact algorithms, but also approximation algorithms. We will present some key results in the next four chapters. This will also give us the opportunity to develop further the two fundamental algorithm design techniques introduced in Chapters 14 and 15.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 104.
    N. Garg, V.V. Vazirani, and M. Yannakakis. Primal—dual approximation algorithms for integral flow and multicut in trees. Algorithmica, 18: 3–20, 1997.MathSciNetCrossRefGoogle Scholar
  2. 125.
    V. Guruswami, S. Khanna, R. Rajaraman, B. Shepherd, and M. Yannakakis. Near-optimal hardness results and approximation algorithms for edge-disjoint and related problems. In Proc. 31st ACM Symposium on the Theory of Computing, pages 19–28, 1999.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