Min-Cost 2-Connected Subgraphs With k Terminals

In the k-2VC problem, we are given an undirected graph G with edge costs and an integer k; the goal is to find a minimum-cost 2-vertex-connected subgraph of G containing at least k vertices. A slightly more general version is obtained if the input also specifies a subset S \subseteq V of terminals and the goal is to find a subgraph containing at least k terminals. Closely related to the k-2VC problem, and in fact a special case of it, is the k-2EC problem, in which the goal is to find a minimum-cost 2-edge-connected subgraph containing k vertices. The k-2EC problem was introduced by Lau et al., who also gave a poly-logarithmic approximation for it. No previous approximation algorithm was known for the more general k-2VC problem. We describe an O(\log n \log k) approximation for the k-2VC problem.

[1]  Mohit Singh,et al.  Survivable network design with degree or order constraints , 2007, STOC '07.

[2]  Mohammad Taghi Hajiaghayi,et al.  The prize-collecting generalized steiner tree problem via a new approach of primal-dual schema , 2006, SODA '06.

[3]  Santosh S. Vempala,et al.  A Constant-Factor Approximation Algorithm for the k-MST Problem , 1999, J. Comput. Syst. Sci..

[4]  Satish Rao,et al.  Paths, trees, and minimum latency tours , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[5]  R. Ravi,et al.  When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks , 1995, SIAM J. Comput..

[6]  Mohammad Taghi Hajiaghayi,et al.  Approximation Algorithms for Nonuniform Buy-at-Bulk Network Design , 2010, SIAM J. Comput..

[7]  Kamal Jain.  A Factor 2 Approximation Algorithm for the Generalized Steiner Network Problem , 2001, Comb..

[8]  Tim Roughgarden,et al.  Approximate k-MSTs and k-Steiner trees via the primal-dual method and Lagrangean relaxation , 2001, Math. Program..

[9]  David R. Karger,et al.  Approximation algorithms for orienteering and discounted-reward TSP , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[10]  Mohammad Taghi Hajiaghayi,et al.  Approximation Algorithms for Non-Uniform Buy-at-Bulk Network Design , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[11]  Dorit S. Hochba,et al.  Approximation Algorithms for NP-Hard Problems , 1997, SIGA.

[12]  David P. Williamson,et al.  A general approximation technique for constrained forest problems , 1992, SODA '92.

[13]  R. Ravi,et al.  When trees collide: an approximation algorithm for the generalized Steiner problem on networks , 1991, STOC '91.

[14]  Chandra Chekuri,et al.  Improved algorithms for orienteering and related problems , 2008, SODA '08.

[15]  David S. Johnson,et al.  Approximation algorithms for combinatorial problems , 1973, STOC.

[16]  Tim Roughgarden,et al.  Approximate k-MSTs and k-Steiner trees via the primal-dual method and Lagrangean relaxation , 2004, Math. Program..

[17]  David P. Williamson,et al.  Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems , 2006, J. Comput. Syst. Sci..

[18]  Paul D. Seymour,et al.  Nowhere-zero 6-flows , 1981, J. Comb. Theory, Ser. B.

[19]  Santosh S. Vempala,et al.  New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen , 1999, SIAM J. Comput..

[20]  Anupam Gupta,et al.  Set connectivity problems in undirected graphs and the directed Steiner network problem , 2008, SODA 2008.

[21]  Uriel Feige,et al.  The Dense k -Subgraph Problem , 2001, Algorithmica.

[22]  Naveen Garg,et al.  A 3-approximation for the minimum tree spanning k vertices , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[23]  David P. Williamson,et al.  Primal-Dual Approximation Algorithms for Integral Flow and Multicut in Trees, with Applications to Matching and Set Cover , 1993, ICALP.

[24]  Mohammad Taghi Hajiaghayi,et al.  Approximation algorithms for node-weighted buy-at-bulk network design , 2007, SODA '07.

[25]  Kamal Jain,et al.  A Factor 2 Approximation Algorithm for the Generalized Steiner Network Problem , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

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

[27]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .