A constant-factor approximation algorithm for the asymmetric traveling salesman problem

Svensson, Ola, Tarnawski, Jakub and Végh, László A. ORCID: 0000-0003-1152-200X (2018) A constant-factor approximation algorithm for the asymmetric traveling salesman problem. In: Proceedings of 50th Annual ACM SIGACT Symposium on the Theory of Computing (STOC’18). Association for Computing Machinery, New York, NY, pp. 204-213. ISBN 9781450355599

Text - Published Version Registered users only Download (1MB)

• Publisher
• Related Item
• Author

Abstract

We give a constant-factor approximation algorithm for the asymmetric traveling salesman problem. Our approximation guarantee is analyzed with respect to the standard LP relaxation, and thus our result confirms the conjectured constant integrality gap of that relaxation. Our techniques build upon the constant-factor approximation algorithm for the special case of node-weighted metrics. Specifically, we give a generic reduction to structured instances that resemble, but are more general than, those arising from node-weighted metrics. For those instances, we then solve Local-Connectivity ATSP, a problem known to be equivalent (in terms of constant-factor approximation) to the asymmetric traveling salesman problem.

Item Type:	Book Section
Official URL:	http://acm-stoc.org/
Additional Information:	© 2018 the Authors
Divisions:	Mathematics
Subjects:	Q Science > QA Mathematics
Date Deposited:	14 Aug 2018 15:26
Last Modified:	20 Oct 2024 17:06
Projects:	335288-OptApprox, EP/M02797X/1
Funders:	European Research Council, Engineering and Physical Sciences Research Council, Simons Foundation
URI:	http://eprints.lse.ac.uk/id/eprint/89855

Actions (login required)

View Item