Revisiting a simple algorithm for the planar multiterminal cut problem

Authors:
Kevin K. H. Cheung;Kyle Harvey
Affiliations:
School of Mathematics and Statistics, Carleton University, 1125 Colonel By Drive, Ottawa, ON K1S 5B6, Canada;School of Mathematics and Statistics, Carleton University, 1125 Colonel By Drive, Ottawa, ON K1S 5B6, Canada
Venue:
Operations Research Letters
Year:
2010

Citing 3
Cited 2

The Complexity of Multiterminal Cuts

SIAM Journal on Computing
The planar multiterminal cut problem

Discrete Applied Mathematics
A simple algorithm for the planar multiway cut problem

Journal of Algorithms

Solving planar k-terminal cut in O(nc√k) time

ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
A polynomial-time algorithm for planar multicuts with few source-sink pairs

IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Yeh (2001) [W.-C. Yeh, A simple algorithm for the planar multiway cut problem, J. Algorithms 39 (2001) 68-77] described a simple algorithm with time complexity O((k-32)^k^-^1(n-k)^2^k^-^4(nk-32k^2+12k)log(n-k)) for the planar minimum k-terminal cut problem. In this paper, an example showing that the algorithm could fail to return a minimum k-cut is given.