Prize-Collecting TSP with a Budget Constraint

We consider constrained versions of the prize-collecting traveling salesman and the minimum spanning tree problems. The goal is to maximize the number of vertices in the returned tour/tree subject to a bound on the tour/tree cost. We present a 2-approximation algorithm for these problems based on a primal-dual approach. The algorithm relies on finding a threshold value for the dual variable corresponding to the budget constraint in the primal and then carefully constructing a tour/tree that is just within budget. Thereby, we improve the best-known guarantees from 3+epsilon and 2+epsilon for the tree and the tour version, respectively. Our analysis extends to the setting with weighted vertices, in which we want to maximize the total weight of vertices in the tour/tree subject to the same budget constraint.

[1]  Chandra Chekuri,et al.  Improved algorithms for orienteering and related problems , 2008, SODA '08.

[2]  Chandra Chekuri,et al.  A recursive greedy algorithm for walks in directed graphs , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[3]  Gerhard Reinelt,et al.  TSPLIB - A Traveling Salesman Problem Library , 1991, INFORMS J. Comput..

[4]  R. Ravi,et al.  Approximation algorithms for distance constrained vehicle routing problems , 2012, Networks.

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

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

[7]  Greg N. Frederickson,et al.  Approximation Algorithms for the Traveling Repairman and Speeding Deliveryman Problems , 2009, Algorithmica.

[8]  Vangelis Th. Paschos,et al.  Algorithms for the On-Line Quota Traveling Salesman Problem , 2004, Inf. Process. Lett..

[9]  R. Ravi,et al.  Approximation algorithms for stochastic orienteering , 2012, SODA.

[10]  Chandra Chekuri,et al.  Approximation Algorithms for Orienteering with Time Windows , 2007, ArXiv.

[11]  Ke Chen,et al.  The orienteering problem in the plane revisited , 2006, SCG '06.

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

[13]  Kaushal K. Shukla,et al.  Approximation Algorithms for P2P Orienteering and Stochastic Vehicle Routing Problem , 2015, ArXiv.

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

[15]  Joan Feigenbaum,et al.  Sharing the Cost of Multicast Transmissions , 2001, J. Comput. Syst. Sci..

[16]  Tal Raviv,et al.  Detection of unusable bicycles in bike-sharing systems , 2016 .

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

[18]  Asaf Levin.  A better approximation algorithm for the budget prize collecting tree problem , 2004, Oper. Res. Lett..

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