A polynomial-time approximation scheme for planar multiway cut

Authors:
MohammadHossein Bateni;MohammadTaghi Hajiaghayi;Philip N. Klein;Claire Mathieu
Affiliations:
Google Research, New York, NY;University of Maryland at College Park;Brown University, Providence, RI;Brown University, Providence, RI
Venue:
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Year:
2012

Citing 19
Cited 4

Send-and-split method for minimum-concave-cost network flows

Mathematics of Operations Research
Finding minimum-quotient cuts in planar graphs

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Approximation algorithms for NP-complete problems on planar graphs

Journal of the ACM (JACM)
The Complexity of Multiterminal Cuts

SIAM Journal on Computing
An improved approximation algorithm for multiway cut

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
The planar multiterminal cut problem

Discrete Applied Mathematics
Rounding algorithms for a geometric embedding of minimum multiway cut

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Optimal 3-Terminal Cuts and Linear Programming

Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
A linear-time approximation scheme for planar weighted TSP

FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
A subset spanner for Planar graphs,: with application to subset TSP

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
A Deterministic Algorithm for Finding All Minimum $k$-Way Cuts

SIAM Journal on Computing
A polynomial-time approximation scheme for Steiner tree in planar graphs

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
A Linear-Time Approximation Scheme for TSP in Undirected Planar Graphs with Edge-Weights

SIAM Journal on Computing
A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest

FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Note: A simple algorithm for multicuts in planar graphs with outer terminals

Discrete Applied Mathematics
An O(n log n) approximation scheme for Steiner tree in planar graphs

ACM Transactions on Algorithms (TALG)
Efficient Algorithms for k-Terminal Cuts on Planar Graphs

ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Approximation schemes for steiner forest on planar graphs and graphs of bounded treewidth

Proceedings of the forty-second ACM symposium on Theory of computing
Steiner tree in planar graphs: an O(n log n) approximation scheme with singly-exponential dependence on epsilon

WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures

Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth

Journal of the ACM (JACM)
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
An o *(1.84 k) parameterized algorithm for the multiterminal cut problem

FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
An O*(1.84k) parameterized algorithm for the multiterminal cut problem

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

Given an undirected graph with edge lengths and a subset of nodes (called the terminals), the multiway cut (also called the multi-terminal cut) problem asks for a subset of edges, with minimum total length, whose removal disconnects each terminal from all others. The problem generalizes minimum s-t cut, but is NP-hard for planar graphs and APX-hard for general graphs [11]. In this paper, we present a PTAS for multiway cut on planar graphs.