Abstract
We show that the classical LP relaxation of the asymmetric traveling salesman path problem (ATSPP) has constant integrality ratio. If \(\rho _{\text {ATSP}}\) and \(\rho _{\text {ATSPP}}\) denote the integrality ratios for the asymmetric TSP and its path version, then \(\rho _{\text {ATSPP}}\le 4\rho _{\text {ATSP}}-3\). We prove an even better bound for node-weighted instances: if the integrality ratio for ATSP on node-weighted instances is \(\rho _{\text {ATSP}}^{\text{ N }W}\), then the integrality ratio for ATSPP on node-weighted instances is at most \(2\rho _{\text {ATSP}}^{\text{ N }W}-1\). Moreover, we show that for ATSP node-weighted instances and unweighted digraph instances are almost equivalent. From this we deduce a lower bound of 2 on the integrality ratio of unweighted digraph instances.
Similar content being viewed by others
References
Boyd, S., Elliott-Magwood, P.: Computing the integrality gap of the asymmetric traveling salesman problem. Electron. Notes Discrete Math. 19, 241–247 (2005)
Charikar, M., Goemans, M.X., Karloff, H.: On the integrality ratio for the asymmetric traveling salesman problem. Math. Oper. Res. 31, 245–252 (2006)
Edmonds, J.: Optimum branchings. J. Res. Natl. Bur. Std. B 71, 233–240 (1967)
Feige, U., Singh, M.: Improved approximation algorithms for traveling salesperson tours and paths in directed graphs. In: Charikar, M., Jansen, K., Reingold, O., Rolim, J.D.P. (eds.) Proceedings of the 10th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems; LNCS 4627, pp. 104–118. Springer, Berlin (2007)
Friggstad, Z., Gupta, A., Singh, M.: An improved integrality gap for asymmetric TSP paths. Math. Oper. Res. 41, 745–757 (2016)
Friggstad, Z., Salavatipour, M.R., Svitkina, Z.: Asymmetric traveling salesman path and directed latency problems. SIAM J. Comput. 42, 1596–1619 (2013)
Gottschalk, C.: Approximation algorithms for the traveling salesman problem in graphs and digraphs. Master’s Thesis, Research Institute for Discrete Mathematics, University of Bonn (2013)
Nagarajan, V., Ravi, R.: The directed minimum latency problem. In: A. Goel, K. Jansen, J.D.P. Rolim, R. Rubinfeld, (eds.) Proceedings of the 11th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems; LNCS 5171, pp. 193–206. Springer, Berlin (2008)
Svensson, O.: Approximating ATSP by relaxing connectivity. In: Proceedings of the 56th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2015), pp. 1–19 (2015)
Svensson, O., Tarnawski, J., Végh, L.: A constant-factor approximation algorithm for the asymmetric traveling salesman problem. In: Proceedings of the 50th Annual ACM Symposium on Theory of Computing (STOC 2018), pp. 204–213 (2018)
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
A preliminary extended abstract of this paper appeared in the IPCO 2019 Proceedings.
Rights and permissions
About this article
Cite this article
Köhne, A., Traub, V. & Vygen, J. The asymmetric traveling salesman path LP has constant integrality ratio. Math. Program. 183, 379–395 (2020). https://doi.org/10.1007/s10107-019-01450-8
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10107-019-01450-8