A Constant-factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem
We give a constant-factor approximation algorithm for the asymmetric traveling salesman problem (ATSP). 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.
The main idea of our approach is a reduction to Subtour Partition Cover, an easier problem obtained by significantly relaxing the general connectivity requirements into local connectivity conditions. We first show that any algorithm for Subtour Partition Cover can be turned into an algorithm for ATSP while only losing a small constant factor in the performance guarantee. Next, we present a reduction from general ATSP instances to structured instances, on which we then solve Subtour Partition Cover, yielding our constant-factor approximation algorithm for ATSP.
Cite this item
Svensson, O., Tarnawski, J., & Vegh, L. A. (2020). A Constant-factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem. Journal of the Acm, 67(6). https://doi.org/10.1145/3424306
Click Copy to copy the citation, or select the text manually.
WOS:000595522200006
2020-11-01
67
6
37
REVIEWED
EPFL