A simple algorithm for the multiway cut problem

Abstract Multiway Cut is a classic graph partitioning problem in which the goal is to disconnect a given set of special vertices called terminals. This problem admits a rich sequence of works. Unfortunately, most of these works resort to the mix of multiple algorithmic components, resulting in both complicated algorithms and analysis. We present a simple algorithm for the Multiway Cut problem that is comprised of a single algorithmic component and achieves an approximation of 11 8 = 1 . 375 .

[1]  Joseph Naor,et al.  Divide-and-conquer approximation algorithms via spreading metrics , 2000, JACM.

[2]  David P. Williamson,et al.  Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.

[3]  Subhash Khot,et al.  Vertex cover might be hard to approximate to within 2-/spl epsiv/ , 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..

[4]  Satish Rao,et al.  A tight bound on approximating arbitrary metrics by tree metrics , 2003, STOC '03.

[5]  Alexander V. Karzanov,et al.  Minimum 0-Extensions of Graph Metrics , 1998, Eur. J. Comb..

[6]  Yuval Rabani,et al.  An improved approximation algorithm for multiway cut , 1998, STOC '98.

[7]  Howard J. Karloff,et al.  A lower bound of 8/(7+(1/k)-1) on the integrality ratio of the Calinescu-Karloff-Rabani relaxation for multiway cut , 2000, Inf. Process. Lett..

[8]  Chao Xu,et al.  Global and Fixed-Terminal Cuts in Digraphs , 2017, APPROX-RANDOM.

[9]  Mihalis Yannakakis,et al.  Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications , 1996, SIAM J. Comput..

[10]  Vijay V. Vazirani,et al.  Approximation Algorithms , 2001, Springer Berlin Heidelberg.

[11]  Mihalis Yannakakis,et al.  Multiway cuts in node weighted graphs , 2004, J. Algorithms.

[12]  Siam Staff.  A 2-Approximation Algorithm for the Directed Multiway Cut Problem , 2002 .

[13]  Frank Thomson Leighton,et al.  Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms , 1999, JACM.

[14]  Mihalis Yannakakis,et al.  The Complexity of Multiterminal Cuts , 1994, SIAM J. Comput..

[15]  Mikkel Thorup,et al.  Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut , 2004, Math. Oper. Res..

[16]  Yuval Rabani,et al.  An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm , 1998, SIAM J. Comput..

[17]  David P. Williamson,et al.  The Design of Approximation Algorithms , 2011 .