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 min-cut, 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

12 Figures and Tables

Showing 1-10 of 267 extracted citations
02040'95'97'99'01'03'05'07'09'11'13'15'17
Citations per Year

515 Citations

Semantic Scholar estimates that this publication has received between 412 and 643 citations based on the available data.

See our FAQ for additional information.