Node-weighted Network Design in Planar and Minor-closed Families of Graphs

We consider node-weighted network design in planar and minor-closed families of graphs. In particular we focus on the edge-connectivity survivable network design problem (EC-SNDP). The input consists of a node-weighted undirected graph G=(V,E) and integral connectivity requirements r(uv) for each pair of nodes uv. The goal is to find a minimum node-weighted subgraph H of G such that, for each pair uv, H contains r(uv) edge-disjoint paths between u and v. Our main result is an O(k)-approximation algorithm for EC-SNDP where k= max uvr(uv) is the maximum requirement. This improves the O(k logn)-approximation known for node-weighted EC-SNDP in general graphs [15]. Our algorithm and analysis applies to the more general problem of covering a proper function with maximum requirement k. Our result is inspired by, and generalizes, the work of Demaine, Hajiaghayi and Klein [5] who gave constant factor approximation algorithms for node-weighted Steiner tree and Steiner forest problems (and more generally covering 0-1 proper functions) in planar and minor-closed families of graphs.

[1]  Jochen Könemann,et al.  Approximation algorithms for network design: A survey , 2011 .

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

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

[4]  Chandra Chekuri,et al.  Prize-Collecting Survivable Network Design in Node-Weighted Graphs , 2012, APPROX-RANDOM.

[5]  Zeev Nutov.  Approximating Steiner Networks with Node-Weights , 2010, SIAM J. Comput..

[6]  Carsten Moldenhauer,et al.  Primal-dual approximation algorithms for Node-Weighted Steiner Forest on planar graphs , 2011, Inf. Comput..

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

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

[9]  David P. Williamson,et al.  A primal-dual schema based approximation algorithm for the element connectivity problem , 2002, SODA '99.

[10]  R. Ravi,et al.  A nearly best-possible approximation algorithm for node-weighted Steiner trees , 1993, IPCO.

[11]  Zeev Nutov.  Survivable Network Activation Problems , 2012, LATIN.

[12]  Philip N. Klein,et al.  Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs , 2009, TALG.

[13]  Fabrizio Grandoni,et al.  An improved LP-based approximation for steiner tree , 2010, STOC '10.

[14]  Piotr Berman,et al.  Primal-Dual Approximation Algorithms for Node-Weighted Network Design in Planar Graphs , 2012, APPROX-RANDOM.

[15]  Bundit Laekhanukit.  An Improved Approximation Algorithm for the Minimum Cost Subset k-Connected Subgraph Problem , 2014, Algorithmica.

[16]  Alexandr V. Kostochka,et al.  Lower bound of the hadwiger number of graphs by their average degree , 1984, Comb..

[17]  Mohammad Taghi Hajiaghayi,et al.  Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth , 2009, JACM.

[18]  Philip N. Klein,et al.  An O(n log n) approximation scheme for Steiner tree in planar graphs , 2009, TALG.

[19]  David P. Williamson,et al.  A primal-dual approximation algorithm for generalized steiner network problems , 1993, Comb..

[20]  Andrew V. Goldberg,et al.  Improved approximation algorithms for network design problems , 1994, SODA '94.

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

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

[23]  Mohammad Taghi Hajiaghayi,et al.  Improved Approximation Algorithms for (Budgeted) Node-Weighted Steiner Problems , 2013, ICALP.

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

[25]  Fabrizio Grandoni,et al.  Steiner Tree Approximation via Iterative Randomized Rounding , 2013, JACM.

[26]  Zeev Nutov.  Approximating Steiner Network Activation Problems , 2011 .

[27]  David P. Williamson,et al.  Primal-Dual Approximation Algorithms for Feedback Problems in Planar Graphs , 1996, Comb..

[28]  Ali Vakilian,et al.  Node-weighted prize-collecting survivable network design problems , 2013 .

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

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

[31]  Debmalya Panigrahi,et al.  Survivable network design problems in wireless networks , 2011, SODA '11.

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

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