A constant-factor approximation algorithm for the asymmetric traveling salesman problem
A constant-factor approximation algorithm for the asymmetric traveling salesman problem
复制标题
非对称旅行商问题的常因子逼近算法
DOI:
10.1145/3188745.3188824
复制
发表时间:
2018
期刊:
影响因子:
--
通讯作者:
Svensson O
中科院分区:
文献类型:
--
作者:
Svensson O
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.
登录
查看更多内容
DOI:
--
发表时间:
2010
期刊:
International Workshop and International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
影响因子:
--
作者:
Hyung;Robert D. Kleinberg;D. Shmoys
通讯作者:
D. Shmoys
影响因子:
2.7
作者:
Anna Köhne;Vera Traub;J. Vygen
通讯作者:
J. Vygen
影响因子:
2.7
作者:
O. Svensson;Jakub Tarnawski;László A. Végh
通讯作者:
László A. Végh
DOI:
--
发表时间:
2014
期刊:
IEEE Annual Symposium on Foundations of Computer Science
影响因子:
--
作者:
Nima Anari;S. Gharan
通讯作者:
S. Gharan
DOI:
--
发表时间:
2007
期刊:
International Workshop and International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
影响因子:
--
作者:
U. Feige;Mohit Singh
通讯作者:
Mohit Singh