Simplex Transformations and the Multiway Cut Problem

We consider Multiway Cut, a basic graph partitioning problem in which the goal is to find the minimum weight collection of edges disconnecting a given set of special vertices called terminals. Multiway Cut admits a well known simplex embedding relaxation, where rounding this embedding is equivalent to partitioning the simplex. Current best known solutions to the problem are comprised of a mix of several different ingredients, resulting in intricate algorithms. Moreover, the best of these algorithms is too complex to fully analyze analytically and its approximation factor was verified using a computer. We propose a new approach to simplex partitioning and the Multiway Cut problem based on general transformations of the simplex that allow dependencies between the different variables. Our approach admits much simpler algorithms, and in addition yields an approximation guarantee for the Multiway Cut problem that (roughly) matches the current best computer verified approximation factor.

[1]  Joseph Naor,et al.  A Linear Programming Formulation and Approximation Algorithms for the Metric Labeling Problem , 2005, SIAM J. Discret. Math..

[2]  Joseph Naor,et al.  Divide-and-conquer approximation algorithms via spreading metrics , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[3]  Jan Vondrák,et al.  Multiway cut, pairwise realizable distributions, and descending thresholds , 2014, STOC.

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

[5]  William H. Cunningham,et al.  Optimal 3-terminal cuts and linear programming , 2006, Math. Program..

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

[7]  Satish Rao,et al.  An improved approximation algorithm for the 0-extension problem , 2003, SODA '03.

[8]  Éva Tardos,et al.  Approximation algorithms for classification problems with pairwise relationships: metric labeling and Markov random fields , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[9]  William H. Cunningham,et al.  Optimal 3-Terminal Cuts and Linear Programming , 1999, IPCO.

[10]  Joseph Naor,et al.  A 2-approximation algorithm for the directed multiway cut problem , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[11]  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..

[12]  Joseph Naor,et al.  Simplex partitioning via exponential clocks and the multiway cut problem , 2013, STOC '13.

[13]  Yuval Rabani,et al.  Approximation algorithms for the 0-extension problem , 2001, SODA '01.

[14]  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..

[15]  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..

[16]  Mikkel Thorup,et al.  Rounding algorithms for a geometric embedding of minimum multiway cut , 1999, STOC '99.

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

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

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

[20]  Marek Karpinski,et al.  Polynomial Time Approximation Schemes for Dense Instances of NP-Hard Problems , 1999, J. Comput. Syst. Sci..

[21]  Joseph Naor,et al.  The hardness of metric labeling , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[22]  Nathan Linial,et al.  The geometry of graphs and some of its algorithmic applications , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[23]  Pasin Manurangsi,et al.  An Improved Integrality Gap for the Călinescu-Karloff-Rabani Relaxation for Multiway Cut , 2017, IPCO.

[24]  Alan M. Frieze,et al.  The regularity lemma and approximation schemes for dense problems , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[25]  Aranyak Mehta,et al.  On Earthmover Distance, Metric Labeling, and 0-Extension , 2009, SIAM J. Comput..

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

[27]  David P. Williamson,et al.  New 3/4-Approximation Algorithms for the Maximum Satisfiability Problem , 1994, SIAM J. Discret. Math..

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

[29]  Mihalis Yannakakis,et al.  Approximate max-flow min-(multi)cut theorems and their applications , 1993, SIAM J. Comput..

[30]  Prasad Raghavendra,et al.  Sdp gaps and ugc hardness for multiway cut, 0-extension, and metric labeling , 2008, STOC.

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