Prize Collecting Traveling Salesman and Related Problems

The most general version of the Prize Collecting Traveling Salesman Problem (PCTSP) was first introduced by Balas [8]. In this problem, a salesman has to collect a certain amount of prizes (the quota) by visiting cities. A known prize can be collected in every city. Furthermore, by not visiting a city, the salesman incurs a pecuniary penalty. The goal is to minimize the total travel distance plus the total penalty, while starting from a given city and collecting the quota. The problem generalizes both the Quota TSP, which is obtained when all the penalties are set to zero, and the Penalty TSP (sometimes unfortunately also called PCTSP), in which there is no required quota, only penalties. A special case of the Quota TSP is the k-TSP, in which all prizes are unitary (k is the quota). The k-TSP is strongly tied to the problem of finding a tree of minimum cost spanning any k vertices in a graph, called the k-MST problem. The k-MST and the k-TSP are NP-hard. They have been the subject of several studies for good approximation

[1]  Santosh S. Vempala,et al.  A Constant-Factor Approximation Algorithm for the k-MST Problem , 1999, J. Comput. Syst. Sci..

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

[3]  Santosh S. Vempala,et al.  New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen , 1999, SIAM J. Comput..

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

[5]  Akhil Kumar,et al.  Efficient quorumcast routing algorithms , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

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

[7]  Mihalis Yannakakis,et al.  The Traveling Salesman Problem with Distances One and Two , 1993, Math. Oper. Res..

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

[9]  George Papageorgiou,et al.  The Complexity of the Travelling Repairman Problem , 1986, RAIRO Theor. Informatics Appl..

[10]  Jon M. Kleinberg,et al.  An improved approximation ratio for the minimum latency problem , 1996, SODA '96.

[11]  Marshall W. Bern,et al.  The Steiner Problem with Edge Lengths 1 and 2 , 1989, Inf. Process. Lett..

[12]  Madhu Sudan,et al.  The minimum latency problem , 1994, STOC '94.

[13]  René Sitters,et al.  The Minimum Latency Problem Is NP-Hard for Weighted Trees , 2002, IPCO.

[14]  Adam Meyerson,et al.  Approximation algorithms for deadline-TSP and vehicle routing with time-windows , 2004, STOC '04.

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

[16]  David R. Karger,et al.  Approximation algorithms for orienteering and discounted-reward TSP , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

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

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

[19]  Sanjeev Arora,et al.  Approximation Schemes for Minimum Latency Problems , 2003, SIAM J. Comput..

[20]  Seth Pettie,et al.  The Dynamic Vertex Minimum Problem and Its Application to Clustering-Type Approximation Algorithms , 2002, SWAT.

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

[22]  Teofilo F. Gonzalez,et al.  P-Complete Approximation Problems , 1976, J. ACM.

[23]  Egon Balas,et al.  The prize collecting traveling salesman problem: II. Polyhedral results , 1995, Networks.

[24]  R. Vohra,et al.  The Orienteering Problem , 1987 .

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

[26]  Douglas B. West,et al.  Extremal results and algorithms for degree sequences of graphs , 1993 .

[27]  R. Ravi,et al.  Spanning trees short or small , 1994, SODA '94.

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

[29]  Satish Rao,et al.  The k-traveling repairman problem , 2003, SODA '03.

[30]  Mihalis Yannakakis,et al.  Searching a Fixed Graph , 1996, ICALP.

[31]  Matteo Fischetti,et al.  The Delivery Man Problem and Cumulative Matroids , 1993, Oper. Res..

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

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

[34]  Giorgio Ausiello,et al.  On Salesmen, Repairmen, Spiders, and Other Traveling Agents , 2000, CIAC.

[35]  Matteo Fischetti,et al.  Weighted k-cardinality trees: Complexity and polyhedral structure , 1994, Networks.