Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design

We consider the problem of finding a minimum edge cost subgraph of an undirected or a directed graph satisfying given connectivity requirements and degree bounds b(·) on nodes. We present an iterative rounding algorithm for this problem. When the graph is undirected and the connectivity requirements are on the element-connectivity with maximum value k, our algorithm computes a solution that is an O(k)-approximation for the edge cost in which the degree of each node v is at most O(k) · b(v). We also consider the no edge cost case where the objective is to find a subgraph satisfying connectivity requirements and degree bounds. Our algorithm for this case outputs a solution in which the degree of each node v is at most 6·b(v)+O(k2). These algorithms can be extended to other well-studied undirected node-connectivity requirements such as uniform, subset and rooted connectivity. When the graph is directed and the connectivity requirement is k-out-connectivity from a root, our algorithm computes a solution that is a 2-approximation for the edge cost in which the degree of each node v is at most 2 · b(v) + O(k).

[1]  Joseph Cheriyan,et al.  A bad example for the iterative rounding method for mincost k-connected spanning subgraphs , 2013, Discret. Optim..

[2]  Guy Kortsarz,et al.  Network-Design with Degree Constraints , 2011, APPROX-RANDOM.

[3]  Bundit Laekhanukit,et al.  An O(log2k)-Approximation Algorithm for the k-Vertex Connected Spanning Subgraph Problem , 2012, SIAM J. Comput..

[4]  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).

[5]  Zeev Nutov.  Approximating Minimum Cost Connectivity Problems via Uncrossable Bifamilies and Spider-Cover Decompositions , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

[6]  Mohit Singh,et al.  Degree bounded matroids and submodular flows , 2008, Comb..

[7]  Guy Kortsarz,et al.  Approximating k-node Connected Subgraphs via Critical Graphs , 2005, SIAM J. Comput..

[8]  Mohit Singh,et al.  Additive approximation for bounded degree survivable network design , 2008, SIAM J. Comput..

[9]  Samir Khuller,et al.  Improved Approximation Algorithms for Uniform Connectivity Problems , 1996, J. Algorithms.

[10]  Nisheeth K. Vishnoi,et al.  Improved Algorithm for Degree Bounded Survivable Network Design Problem , 2009, SWAT.

[11]  Guy Kortsarz,et al.  Approximating Minimum-Cost Connectivity Problems , 2007, Handbook of Approximation Algorithms and Metaheuristics.

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

[13]  W. Mader.  Ecken vom Gradn in minimalenn-fach zusammenhängenden Graphen , 1972 .

[14]  Ali Vakilian,et al.  Improved approximation algorithms for degree-bounded network design problems with node connectivity requirements , 2014, STOC.

[15]  Bill Jackson,et al.  Independence free graphs and vertex connectivity augmentation , 2005, J. Comb. Theory, Ser. B.

[16]  Santosh S. Vempala,et al.  Network Design via Iterative Rounding of Setpair Relaxations , 2022 .

[17]  Bundit Laekhanukit,et al.  An o(log2 k)-approximation algorithm for the k-vertex connected spanning subgraph problem , 2008, STOC '08.

[18]  Zeev Nutov.  Approximating minimum-cost edge-covers of crossing biset-families , 2014, Comb..

[19]  Zeev Nutov,et al.  Approximating subset k-connectivity problems , 2011, J. Discrete Algorithms.

[20]  András Frank,et al.  Rooted k-connections in digraphs , 2009, Discret. Appl. Math..

[21]  A. Frank,et al.  An application of submodular flows , 1989 .

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

[23]  Rajeev Motwani,et al.  K-connected Spanning Subgraphs of Low Degree , 2006, Electron. Colloquium Comput. Complex..

[24]  Zeev Nutov.  Approximating minimum-cost connectivity problems via uncrossable bifamilies , 2012, TALG.

[25]  Bill Jackson,et al.  Independence free graphs and vertex connectivity augmentation , 2001, J. Comb. Theory, Ser. B.

[26]  Klaus Jansen,et al.  Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques , 2006, Lecture Notes in Computer Science.

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

[28]  Hong Zhou,et al.  A unified algorithm for degree bounded survivable network design , 2014, Math. Program..

[29]  László A. Végh,et al.  Approximating Minimum-Cost k-Node Connected Subgraphs via Independence-Free Graphs , 2012, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.

[30]  Santosh S. Vempala,et al.  An Approximation Algorithm for the Minimum-Cost k-Vertex Connected Subgraph , 2003, SIAM J. Comput..

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

[32]  Zeev Nutov.  Degree Constrained Node-Connectivity Problems , 2013, Algorithmica.

[33]  Jochen Könemann,et al.  On generalizations of network design problems with degree bounds , 2010, Mathematical Programming.

[34]  Sanjeev Khanna,et al.  An O(k3log n)-Approximation Algorithm for Vertex-Connectivity Survivable Network Design , 2012, Theory Comput..

[35]  Mohit Singh,et al.  Simpler analysis of LP extreme points for traveling salesman and survivable network design problems , 2010, Oper. Res. Lett..

[36]  Mimmo Parente,et al.  A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph , 1999, J. Algorithms.

[37]  Zeev Nutov,et al.  An almost O(log k)-approximation for k-connected subgraphs , 2009, SODA.

[38]  Samir Khuller,et al.  Improved approximation algorithms for uniform connectivity problems , 1995, STOC '95.

[39]  András Frank,et al.  Minimal Edge-Coverings of Pairs of Sets , 1995, J. Comb. Theory B.

[40]  Sanjeev Khanna,et al.  An O(k3log n)-Approximation Algorithm for Vertex-Connectivity Survivable Network Design , 2012, Theory of Computing.

[41]  Nikhil Bansal,et al.  Additive guarantees for degree bounded directed network design , 2008, SIAM J. Comput..

[42]  David P. Williamson,et al.  The Design of Approximation Algorithms , 2011 .