Simple and Fast Rounding Algorithms for Directed and Node-weighted Multiway Cut

We study the multiway cut problem in directed graphs and one of its special cases, the node-weighted multiway cut problem in undirected graphs. In D irected M ultiway C ut (D ir -MC) the input is an edge-weighted directed graph G = (V, E) and a set of k terminal nodes {s1, s2, . . ., sk} ⊆ V; the goal is to find a min-weight subset of edges whose removal ensures that there is no path from si to sj for any i ≠ j. In N ode - weighted M ultiway C ut (N ode - wt -MC) the input is a node-weighted undirected graph G and a set of k terminal nodes {s1, S2, . . . ., sk} ⊆ V; the goal is to find a min-weight subset of nodes whose removal ensures that there is no path from si to sj for any i ≠ j. D ir -MC admits a 2-approximation [28] and N ode - wt -MC admits a 2(1 - 1/k)-approximation [21], both via rounding of LP relaxations. Previous rounding algorithms for these problems, from nearly twenty years ago, are based on careful rounding of an optimum solution to an LP relaxation. This is particularly true for D ir -MC for which the rounding relies on a custom LP formulation instead of the natural distance based LP relaxation [28]. In this paper we describe extremely simple and near linear-time rounding algorithms for D ir -MC and M ode - wt -MC via a natural distance based LP relaxation. The dual of this relaxation is a special case of the maximum multicommodity flow problem. Our algorithms achieve the same bounds as before but have the significant advantage in that they can work with any feasible solution to the relaxation. Consequently, in addition to obtaining "book" proofs of LP rounding for these two basic problems, we also obtain significantly faster approximation algorithms by taking advantage of known algorithms for computing near-optimal solutions for maximum multicommodity flow problems. We also investigate lower bounds for D ir -MC when k = 2 and prove that the integrality gap of the LP relaxation is 2 even in planar directed graphs.

[1]  Joseph Naor,et al.  An 8-Approximation Algorithm for the Subset Feedback Vertex Set Problem , 2000, SIAM J. Comput..

[2]  Mihalis Yannakakis,et al.  Multiway Cuts in Directed and Node Weighted Graphs , 1994, ICALP.

[3]  Chandra Chekuri,et al.  Submodular Cost Allocation Problem and Applications , 2011, ICALP.

[4]  D. Bienstock,et al.  Approximating fractional packings and coverings in O(1/ε) iterations , 2006, STOC 2006.

[5]  S. Safra,et al.  On the hardness of approximating minimum vertex cover , 2005 .

[6]  Leonid Khachiyan,et al.  Fast Approximation Schemes for Convex Programs with Many Blocks and Coupling Constraints , 1994, SIAM J. Optim..

[7]  Noga Alon,et al.  Improved approximation for directed cut problems , 2007, STOC '07.

[8]  Minming Li,et al.  Register Loading via Linear Programming , 2014, Algorithmica.

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

[10]  Chandra Chekuri,et al.  Approximation Algorithms for Submodular Multiway Partition , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

[11]  Neal E. Young,et al.  Randomized rounding without solving the linear program , 1995, SODA '95.

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

[13]  Aleksander Madry,et al.  Faster approximation schemes for fractional multicommodity flow problems via dynamic graph algorithms , 2010, STOC '10.

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

[15]  Toshihide Ibaraki,et al.  Greedy splitting algorithms for approximating multiway partition problems , 2005, Math. Program..

[16]  Daniel Bienstock,et al.  Approximating Fractional Packings and Coverings in O(1/epsilon) Iterations , 2006, SIAM J. Comput..

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

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

[19]  Jan Vondrák,et al.  Local Distribution and the Symmetry Gap: Approximability of Multiway Partitioning Problems , 2013, SODA.

[20]  Michael E. Saks,et al.  A Lower Bound On The Integrality Gap For Minimum Multicut In Directed Networks , 2004, Comb..

[21]  Sreeram Kannan,et al.  Delay-constrained unicast and the triangle-cast problem , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).

[22]  Lisa Fleischer,et al.  Approximating Fractional Multicommodity Flow Independent of the Number of Commodities , 2000, SIAM J. Discret. Math..

[23]  Jochen Könemann,et al.  Faster and simpler algorithms for multicommodity flow and other fractional packing problems , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

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

[25]  Sariel Har-Peled.  Computing the k Nearest-Neighbors for all Vertices via Dijkstra , 2016, ArXiv.

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

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

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

[29]  Daniel Bienstock,et al.  Potential Function Methods for Approximately Solving Linear Programming Problems: Theory and Practice , 2002 .

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

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

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

[33]  Éva Tardos,et al.  Fast approximation algorithms for fractional packing and covering problems , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[34]  Sreeram Kannan,et al.  Multicommodity flows and cuts in polymatroidal networks , 2011, ITCS '12.

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