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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Notes
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.
H. Saran and V.V. Vazirani. Finding k-cuts within twice the optimal. SIAM Journal on Computing, 24: 101–108, 1995.
R.E. Gomory and T.C. Hu. Multi-terminal network flows. Journal of the SIAM, 9: 551–570, 1961.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Vazirani, V.V. (2003). Multiway Cut and k-Cut. In: Approximation Algorithms. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-04565-7_4
Download citation
DOI: https://doi.org/10.1007/978-3-662-04565-7_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-08469-0
Online ISBN: 978-3-662-04565-7
eBook Packages: Springer Book Archive