An LMP O(log n)-Approximation Algorithm for Node Weighted Prize Collecting Steiner Tree

In the node-weighted prize-collecting Steiner tree problem (NW-PCST) we are given an undirected graph G = (V, E), non-negative costs c(u) and penalties π(u) for each u ∈ V . The goal is to find a tree T that minimizes the total cost of the vertices spanned by T plus the total penalty of vertices not in T. This problem is well-known to be set-cover hard to approximate. Moss and Rabani (STOC'01) presented a primal-dual Lagrangean-multiplier-preserving O(ln |V |)-approximation algorithm for this problem. We show a serious problem with the algorithm, and present a new, fundamentally different primal-dual method achieving the same performance guarantee. Our algorithm introduces several novel features to the primal-dual method that may be of independent interest.

[1]  Alex Zelikovsky,et al.  Tighter Bounds for Graph Steiner Tree Approximation , 2005, SIAM J. Discret. Math..

[2]  Pierre Dupont,et al.  Systems biology Advance Access publication March 12, 2010 , 2009 .

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

[4]  Kamal Jain.  A Factor 2 Approximation Algorithm for the Generalized Steiner Network Problem , 2001, Comb..

[5]  Eytan Modiano,et al.  Construction and Maintenance of Wireless Mobile Backbone Networks , 2009, IEEE/ACM Transactions on Networking.

[6]  Yuval Rabani,et al.  Approximation algorithms for constrained for constrained node weighted steiner tree problems , 2001, STOC '01.

[7]  Sharon Goldberg,et al.  Technology Diffusion in Communication Networks , 2012, ArXiv.

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

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

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

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

[12]  Jochen Könemann,et al.  Better Approximation Algorithms for Technology Diffusion , 2013, ESA.

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

[14]  Mohammad Taghi Hajiaghayi,et al.  Improved Approximation Algorithms for PRIZE-COLLECTING STEINER TREE and TSP , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

[15]  David Pritchard,et al.  Hypergraphic LP Relaxations for Steiner Trees , 2009, SIAM J. Discret. Math..

[16]  Tim Roughgarden,et al.  Approximate k-MSTs and k-Steiner trees via the primal-dual method and Lagrangean relaxation , 2001, Math. Program..

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