Covering problems in edge- and node-weighted graphs

This paper discusses the graph covering problem in which a set of edges in an edge- and node-weighted graph is chosen to satisfy some covering constraints while minimizing the sum of the weights. In this problem, because of the large integrality gap of a naive linear programming (LP) relaxation, LP rounding algorithms based on the relaxation yield poor performance. Here we propose a stronger LP relaxation for the graph covering problem. The proposed relaxation is applied to designing primal-dual algorithms for two fundamental graph covering problems: the prize-collecting edge dominating set problem and the multicut problem in trees. Our algorithms are an exact polynomial-time algorithm for the former problem, and a 2-approximation algorithm for the latter problem. These results match the currently known best results for purely edge-weighted graphs.

[1]  Ojas Parekh,et al.  Erratum to: Linear Time Algorithms for Generalized Edge Dominating Set Problems , 2008, Algorithmica.

[2]  Naoyuki Kamiyama,et al.  The Prize-Collecting Edge Dominating Set Problem in Trees , 2010, MFCS.

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

[4]  Yuval Rabani,et al.  ON THE HARDNESS OF APPROXIMATING MULTICUT AND SPARSEST-CUT , 2005, 20th Annual IEEE Conference on Computational Complexity (CCC'05).

[5]  Ding-Zhu Du,et al.  On the construction of 2-connected virtual backbone in wireless networks , 2009, IEEE Transactions on Wireless Communications.

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

[7]  Donghyun Kim,et al.  A better constant approximation for minimum 3-connected m-dominating set problem in unit disk graph using Tutte decomposition , 2015, 2015 IEEE Conference on Computer Communications (INFOCOM).

[8]  Mohit Singh,et al.  Online Node-Weighted Steiner Tree and Related Problems , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

[9]  Takuro Fukunaga.  Spider Covers for Prize-Collecting Network Activation Problem , 2017, ACM Trans. Algorithms.

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

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

[12]  Robert D. Carr,et al.  A $${{10}}$$ -Approximation Algorithm for a Generalization of the Weighted Edge-Dominating Set Problem , 2001, J. Comb. Optim..

[13]  Thomas Rothvoß,et al.  Matroids and integrality gaps for hypergraphic steiner tree relaxations , 2011, STOC '12.

[14]  Takuro Fukunaga,et al.  Covering problems in edge- and node-weighted graphs , 2014, Discret. Optim..

[15]  Ojas Parekh,et al.  Approximability of the capacitated b-edge dominating set problem , 2007, Theor. Comput. Sci..

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

[17]  László Lovász,et al.  On the ratio of optimal integral and fractional covers , 1975, Discret. Math..

[18]  Mihalis Yannakakis,et al.  Primal-dual approximation algorithms for integral flow and multicut in trees , 1997, Algorithmica.

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

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

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

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

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

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

[25]  Hiroshi Nagamochi,et al.  A 2-approximation algorithm for the minimum weight edge dominating set problem , 2002, Discret. Appl. Math..

[26]  Mihalis Yannakakis,et al.  The Complexity of Multiterminal Cuts , 1994, SIAM J. Comput..

[27]  Ojas Parekh,et al.  Linear Time Algorithms for Generalized Edge Dominating Set Problems , 2005, WADS.

[28]  Jochen Könemann,et al.  An LMP O(log n)-Approximation Algorithm for Node Weighted Prize Collecting Steiner Tree , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.

[29]  Dorit S. Hochbaum,et al.  Heuristics for the fixed cost median problem , 1982, Math. Program..

[30]  Ojas Parekh,et al.  Approximation algorithms for partially covering with edges , 2008, Theor. Comput. Sci..

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

[32]  Mohammad Taghi Hajiaghayi,et al.  Online Node-Weighted Steiner Forest and Extensions via Disk Paintings , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.

[33]  Vasek Chvátal,et al.  A Greedy Heuristic for the Set-Covering Problem , 1979, Math. Oper. Res..

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