A Technique for Improving Approximation Algorithms for Prize-Collecting Problems

We study the prize-collecting versions of the Steiner tree (PCST) and traveling salesman (PCTSP) problems: given a graph (V,E) with costs on each edge and a penalty on each node, the goal is to find a tree (for PCST) or cycle (for PCTSP), that minimizes the sum of the edge costs in the tree/cycle and the penalties of the nodes not spanned by it. In addition to being a useful theoretical tool for helping to solve other optimization problems, PCST has been applied fruitfully to the optimization of real-world telecommunications networks. The most recent improvements for these problems, giving a 2-approximation algorithm for each, appeared first in 1992. The natural linear programming (LP) relaxation of PCST has an integrality ratio of 2, which has been a barrier to further improvements for this problem. We present (2 )-approximation algorithms for both problems, connected by a general technique for improving prize-collecting algorithms that manages to circumvent the integrality ratio barrier.

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

[2]  Sunil Arya,et al.  A 2.5-Factor Approximation Algorithm for the k-MST Problem , 1998, Inf. Process. Lett..

[3]  David P. Williamson,et al.  A Faster, Better Approximation Algorithm for the Minimum Latency Problem , 2008, SIAM J. Comput..

[4]  David S. Johnson,et al.  The prize collecting Steiner tree problem: theory and practice , 2000, SODA '00.

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

[6]  Naveen Garg,et al.  A 3-approximation for the minimum tree spanning k vertices , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

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

[8]  Carlos Eduardo Ferreira,et al.  A note on Johnson, Minkoff and Phillips' algorithm for the Prize-Collecting Steiner Tree Problem , 2010, ArXiv.

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

[10]  Chuan Yi Tang,et al.  A 2.|E|-Bit Distributed Algorithm for the Directed Euler Trail Problem , 1993, Inf. Process. Lett..

[11]  Sanjeev Arora,et al.  A 2 + ɛ approximation algorithm for the k-MST problem , 2000, SODA '00.

[12]  Sanjeev Arora,et al.  A 2+epsilon approximation algorithm for the k-MST problem , 2000, SODA.

[13]  Egon Balas,et al.  The prize collecting traveling salesman problem , 1989, Networks.

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

[15]  Vijay V. Vazirani,et al.  Approximation algorithms for metric facility location and k-Median problems using the primal-dual schema and Lagrangian relaxation , 2001, JACM.

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

[17]  Naveen Garg,et al.  Saving an epsilon: a 2-approximation for the k-MST problem in graphs , 2005, STOC '05.

[18]  Satish Rao,et al.  Paths, trees, and minimum latency tours , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[19]  David P. Williamson,et al.  A note on the prize collecting traveling salesman problem , 1993, Math. Program..