Partial multicuts in trees

Let T = (V,E) be an undirected tree, in which each edge is associated with a non-negative cost, and let { s1, t1 }, ..., { sk, tk } be a collection of k distinct pairs of vertices. Given a requirement parameter t ≤ k, the partial multicut on a tree problem asks to find a minimum cost set of edges whose removal from T disconnects at least t out of these k pairs. This problem generalizes the well-known multicut on a tree problem, in which we are required to disconnect all given pairs. The main contribution of this paper is an (${\frac{8}{3}}+{\epsilon}$)-approximation algorithm for partial multicut on a tree, whose run time is strongly polynomial for any fixed e > 0. This result is achieved by introducing problem-specific insight to the general framework of using the Lagrangian relaxation technique in approximation algorithms. Our algorithm utilizes a heuristic for the closely related prize-collecting variant, in which we are not required to disconnect all pairs, but rather incur penalties for failing to do so. We provide a Lagrangian multiplier preserving algorithm for the latter problem, with an approximation factor of 2. Finally, we present a new 2-approximation algorithm for multicut on a tree, based on LP-rounding.

[1]  Nader H. Bshouty,et al.  Massaging a Linear Programming Solution to Give a 2-Approximation for a Generalization of the Vertex Cover Problem , 1998, STACS.

[2]  Mihalis Yannakakis,et al.  Primal-dual approximation algorithms for integral flow and multicut in trees , 1997, Algorithmica.

[3]  Asaf Levin.  Strongly polynomial-time approximation for a class of bicriteria problems , 2004, Oper. Res. Lett..

[4]  Nimrod Megiddo,et al.  Combinatorial optimization with rational objective functions , 1978, Math. Oper. Res..

[5]  Toshihide Ibaraki,et al.  Constant Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem , 2000, J. Algorithms.

[6]  V VaziraniVijay,et al.  Approximation algorithms for metric facility location and k-Median problems using the primal-dual schema and Lagrangian relaxation , 2001 .

[7]  Reuven Bar-Yehuda,et al.  Using homogenous weights for approximating the partial cover problem , 2001, SODA '99.

[8]  Mohit Singh,et al.  Approximating the k-multicut problem , 2006, SODA '06.

[9]  David B. Shmoys,et al.  Lagrangian Relaxation for the k-Median Problem: New Insights and Continuity Properties , 2003, ESA.

[10]  S. Khuller,et al.  Approximation algorithms for partial covering problems , 2001, J. Algorithms.

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

[12]  Subhash Khot,et al.  On the power of unique 2-prover 1-round games , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.

[13]  Dorit S. Hochbaum,et al.  Approximation Algorithms for the Set Covering and Vertex Cover Problems , 1982, SIAM J. Comput..

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

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

[16]  Vijay V. Vazirani,et al.  Approximation algorithms for metric facility location and k-Median problems using the primal-dual schema and Lagrangian relaxation , 2001, JACM.

[17]  Dorit S. Hochbaum,et al.  The t-Vertex Cover Problem: Extending the Half Integrality Framework with Budget Constraints , 1998, APPROX.

[18]  Petr Slavík.  Improved Performance of the Greedy Algorithm for Partial Cover , 1997, Inf. Process. Lett..

[19]  Amin Saberi,et al.  A new greedy approach for facility location problems , 2002, STOC '02.

[20]  Yuval Rabani,et al.  ON THE HARDNESS OF APPROXIMATING MULTICUT AND SPARSEST-CUT , 2005, 20th Annual IEEE Conference on Computational Complexity (CCC'05).