The Complexity of Multiterminal Cuts

Abstract

In the Multiterminal Cut problem we are given an edge-weighted graph and a subset of the vertices called terminals, and asked for a minimum weight set of edges that separates each terminal from all the others. When the number k of terminals is two, this is simply the mincut, max-flow problem, and can be solved in polynomial time. We show that the problem becomes NP-hard as soon as k = 3, but can be solved in polynomial time for planar graphs for any fixed k. The planar problem is NP-hard, however, if k is not fixed. We also describe a simple approximation algorithm for arbitrary graphs that is guaranteed to come within a factor of 2 − 2/ k of the optimal cut weight.

DOI: 10.1137/S0097539792225297

Extracted Key Phrases

13 Figures and Tables

02040'96'98'00'02'04'06'08'10'12'14'16
Citations per Year

503 Citations

Semantic Scholar estimates that this publication has 503 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@article{Dahlhaus1994TheCO, title={The Complexity of Multiterminal Cuts}, author={Elias Dahlhaus and David S. Johnson and Christos H. Papadimitriou and Paul D. Seymour and Mihalis Yannakakis}, journal={SIAM J. Comput.}, year={1994}, volume={23}, pages={864-894} }