Primal-Dual Approximation Algorithms for Node-Weighted Network Design in Planar Graphs

We present primal-dual algorithms which give a 2.4 approximation for a class of node-weighted network design problems in planar graphs, introduced by Demaine, Hajiaghayi and Klein (ICALP’09). This class includes Node-Weighted Steiner Forest problem studied recently by Moldenhauer (ICALP’11) and other node-weighted problems in planar graphs that can be expressed using (0,1)-proper functions introduced by Goemans and Williamson. We show that these problems can be equivalently formulated as feedback vertex set problems and analyze approximation factors guaranteed by different violation oracles within the primal-dual framework developed by Goemans and Williamson.

[1]  Binhai Zhu,et al.  Combinatorial Optimization and Applications , 2014, Lecture Notes in Computer Science.

[2]  Jan Remy,et al.  Approximation Schemes for Node-Weighted Geometric Steiner Tree Problems , 2005, APPROX-RANDOM.

[3]  S. Safra,et al.  On the hardness of approximating minimum vertex cover , 2005 .

[4]  Reuven Bar-Yehuda,et al.  Approximation algorithms for the vertex feedback set problem with applications to constraint satisfaction and Bayesian inference , 1994, SODA '94.

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

[6]  Piotr Berman,et al.  A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem , 1999, SIAM J. Discret. Math..

[7]  Mihalis Yannakakis,et al.  Optimization, approximation, and complexity classes , 1991, STOC '88.

[8]  Laurence A. Wolsey,et al.  Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 4th International Conference, CPAIOR 2007, Brussels, Belgium, May 23-26, 2007, Proceedings , 2007, CPAIOR.

[9]  Erik D. Demaine,et al.  Bidimensionality: new connections between FPT algorithms and PTASs , 2005, SODA '05.

[10]  John M. Lewis,et al.  The Node-Deletion Problem for Hereditary Properties is NP-Complete , 1980, J. Comput. Syst. Sci..

[11]  Bistra N. Dilkina,et al.  Solving Connected Subgraph Problems in Wildlife Conservation , 2010, CPAIOR.

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

[13]  Sudipto Guha,et al.  Efficient recovery from power outage (extended abstract) , 1999, STOC '99.

[14]  Joseph Naor,et al.  Approximating Minimum Feedback Sets and Multicuts in Directed Graphs , 1998, Algorithmica.

[15]  Siam J. CoMPtrr,et al.  FINDING A MAXIMUM CUT OF A PLANAR GRAPH IN POLYNOMIAL TIME * , 2022 .

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

[17]  Dan Geiger,et al.  Optimization of Pearl's Method of Conditioning and Greedy-Like Approximation Algorithms for the Vertex Feedback Set Problem , 1996, Artif. Intell..

[18]  Weili Wu,et al.  A PTAS for Node-Weighted Steiner Tree in Unit Disk Graphs , 2009, COCOA.

[19]  Andrew B. Kahng,et al.  New graph bipartizations for double-exposure, bright field alternating phase-shift mask layout , 2001, ASP-DAC '01.

[20]  Mihalis Yannakakis,et al.  Node-and edge-deletion NP-complete problems , 1978, STOC.

[21]  J. G. Pierce,et al.  Geometric Algorithms and Combinatorial Optimization , 2016 .

[22]  Dror Rawitz,et al.  Local ratio: A unified framework for approximation algorithms. In Memoriam: Shimon Even 1935-2004 , 2004, CSUR.

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

[24]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

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

[26]  Joseph Naor,et al.  An 8-approximation algorithm for the subset feedback vertex set problem , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

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

[28]  Yuval Rabani,et al.  Approximation Algorithms for Constrained Node Weighted Steiner Tree Problems , 2007, SIAM J. Comput..

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

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

[31]  Sorin C. Popescu,et al.  Lidar Remote Sensing , 2011 .

[32]  Subhash Khot,et al.  Vertex cover might be hard to approximate to within 2-/spl epsiv/ , 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..