Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

The asymmetric traveling salesman path LP has constant integrality ratio

  • Full Length Paper
  • Series B
  • Published:
Mathematical Programming Submit manuscript

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8

Similar content being viewed by others

References

  1. Boyd, S., Elliott-Magwood, P.: Computing the integrality gap of the asymmetric traveling salesman problem. Electron. Notes Discrete Math. 19, 241–247 (2005)

    Article  Google Scholar 

  2. Charikar, M., Goemans, M.X., Karloff, H.: On the integrality ratio for the asymmetric traveling salesman problem. Math. Oper. Res. 31, 245–252 (2006)

    Article  MathSciNet  Google Scholar 

  3. Edmonds, J.: Optimum branchings. J. Res. Natl. Bur. Std. B 71, 233–240 (1967)

    MathSciNet  MATH  Google Scholar 

  4. 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)

  5. Friggstad, Z., Gupta, A., Singh, M.: An improved integrality gap for asymmetric TSP paths. Math. Oper. Res. 41, 745–757 (2016)

    Article  MathSciNet  Google Scholar 

  6. Friggstad, Z., Salavatipour, M.R., Svitkina, Z.: Asymmetric traveling salesman path and directed latency problems. SIAM J. Comput. 42, 1596–1619 (2013)

    Article  MathSciNet  Google Scholar 

  7. 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)

  8. 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)

  9. 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)

  10. 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)

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Vera Traub.

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

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

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

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10107-019-01450-8

Keywords

Mathematics Subject Classification