On a Partition LP Relaxation for Min-Cost 2-Node Connected Spanning Subgraphs

Our motivation is to improve on the best approximation guarantee known for the problem of finding a minimum-cost 2-node connected spanning subgraph of a given undirected graph with nonnegative edge costs. We present an LP (Linear Programming) relaxation based on partition constraints. The special case where the input contains a spanning tree of zero cost is called 2NC-TAP. We present a greedy algorithm for 2NC-TAP, and we analyze it via dual-fitting for our partition LP relaxation.

[1]  Joseph JáJá,et al.  Approximation Algorithms for Several Graph Augmentation Problems , 1981, SIAM J. Comput..

[2]  Guy Kortsarz,et al.  Approximating Node Connectivity Problems via Set Covers , 2003, Algorithmica.

[3]  Vera Traub,et al.  Local Search for Weighted Tree Augmentation and Steiner Tree , 2021, SODA.

[4]  David Pritchard,et al.  A partition-based relaxation for Steiner trees , 2007, Math. Program..

[5]  Jochen Könemann,et al.  On the integrality ratio for tree augmentation , 2008, Oper. Res. Lett..

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

[7]  Zeev Nutov.  2-node-connectivity Network Design , 2020, ArXiv.

[8]  Alexander Schrijver,et al.  Combinatorial optimization. Polyhedra and efficiency. , 2003 .

[9]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[10]  S. Chopra.  On the spanning tree polyhedron , 1989 .

[11]  A. Frank.  Connections in Combinatorial Optimization , 2011 .

[12]  Rong-chii Duh,et al.  Approximation of k-set cover by semi-local optimization , 1997, STOC '97.

[13]  Clyde L. Monma,et al.  Minimum-weight two-connected spanning networks , 1990, Math. Program..

[14]  Joseph JáJá,et al.  On the Relationship between the Biconnectivity Augmentation and Traveling Salesman Problems , 1982, Theor. Comput. Sci..

[15]  Vera Traub,et al.  A Better-Than-2 Approximation for Weighted Tree Augmentation , 2021, 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS).

[16]  Nachshon Cohen,et al.  A (1 + ln 2)-Approximation Algorithm for Minimum-Cost 2-Edge-Connectivity Augmentation of Trees with Constant Radius , 2011, APPROX-RANDOM.

[17]  A. Zelikovsky.  Better approximation bounds for the network and Euclidean Steiner tree problems , 1996 .