Paper Info
Title
A Constant-factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem
Abstract
AbstractWe 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.
Year
DOI
Venue
2020
10.1145/3424306
Journal of the ACM
Keywords
DocType
Volume
Traveling salesman problem, Held-Karp relaxation, subtours, network flows, connectivity
Journal
67
Issue
ISSN
Citations 
6
0004-5411
0
PageRank 
References 
Authors
0.34
0
3
Name
Order
Citations
PageRank
Ola Svensson134936.31
Jakub Tarnawski2166.34
László A. Végh37417.96