Abstract
We present a primal-dual ⌈log(n) ⌉-approximation algorithm for the version of the asymmetric prize collecting traveling salesman problem, where the objective is to find a directed tour that visits a subset of vertices such that the length of the tour plus the sum of penalties associated with vertices not in the tour is as small as possible. The previous work on the problem [9] is based on the Held-Karp relaxation and heuristic methods such as the Frieze et al.’s heuristic [6] or the recent Asadpour et al.’s heuristic for the ATSP [2]. Depending on which of the two heuristics is used, it gives respectively 1 + ⌈log(n) ⌉ and \(3+ 8\frac{\log(n)}{\log(\log(n))}\) as an approximation ratio. Our approximation ratio ⌈log(n) ⌉ outperforms the first in theory and the second in practice. Moreover, unlike the method in [9], our algorithm is combinatorial.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Archer, A., Bateni, M., Hajiaghayi, M., Karloff, H.: Improved Approximation Algorithms for Prize-Collecting Steiner Tree and TSP. In: Proceedings of the 50th Annual Symposium on Foundations of Computer Science (2009)
Asadpour, A., Goemans, M.X., Madry, A., Oveis Gharan, S., Saberi, A.: An O(log n/log log n)-approximation algorithm for the asymmetric traveling salesman problem. In: 21st ACM-SIAM Symposium on Discrete Algorithms (2010)
Dell’Amico, M., Maffioli, F., Väbrand, P.: On Prize-collecting Tours and the Asymmetric Travelling Salesman Problem. Int. Trans. Opl Res. 2, 297–308 (1995)
Balas, E.: The prize collecting traveling salesman problem. Networks 19, 621–636 (1989)
Bienstock, D., Goemans, M.X., Simchi-Levi, D., Williamson, D.P.: A note on the prize collecting traveling salesman problem. Math. Prog. 59, 413–420 (1993)
Frieze, A.M., Galbiati, G., Maffioli, F.: On the worst case performance of some algorithms for the asymmetric traveling salesman problem. Networks 12, 23–39 (1982)
Goemans, M.X.: Combining approximation algorithms for the prize-collecting TSP, arXiv:0910.0553v1 (2009)
Goemans, M.X., Williamson: A general approximation technique for constrained forest problems. SIAM Journal on Computing 24, 296–317 (1995)
Nguyen, V.H., Nguyen, T.T.: Approximating the assymetric profitable tour, Proceedings of International Symposium on Combinatorial Optimization. In: Electronic Notes in Discrete Mathematics, vol. 36C, pp. 907–914 (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nguyen, V.H. (2010). A Primal-Dual Approximation Algorithm for the Asymmetric Prize-Collecting TSP. In: Wu, W., Daescu, O. (eds) Combinatorial Optimization and Applications. COCOA 2010. Lecture Notes in Computer Science, vol 6508. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17458-2_22
Download citation
DOI: https://doi.org/10.1007/978-3-642-17458-2_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17457-5
Online ISBN: 978-3-642-17458-2
eBook Packages: Computer ScienceComputer Science (R0)