Advertisement

Multiway Cut and k-Cut

  • Vijay V. Vazirani

Abstract

The theory of cuts occupies a central place in the study of exact algorithms In this chapter, we will present approximation algorithms for natural generalizations of the minimum cut problem. These generalizations are NP-hard.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Notes

  1. 60.
    E. Dahlhaus, D.S. Johnson, C.H. Papadimitriou, P.D. Seymour, and M. Yannakakis. The complexity of multiterminal cuts. SIAM Journal on Computing, 23: 864–894, 1994.MathSciNetCrossRefGoogle Scholar
  2. 241.
    H. Saran and V.V. Vazirani. Finding k-cuts within twice the optimal. SIAM Journal on Computing, 24: 101–108, 1995.MathSciNetCrossRefGoogle Scholar
  3. 116.
    R.E. Gomory and T.C. Hu. Multi-terminal network flows. Journal of the SIAM, 9: 551–570, 1961.MathSciNetzbMATHGoogle 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