On the approximability of the traveling salesman problem

被引：48

作者：

Papadimitriou, CH ^{[1
]}

Vempala, S

机构：

[1] Univ Calif Berkeley, Comp Sci Div, Berkeley, CA 94720 USA

[2] MIT, Dept Math, Cambridge, MA 02139 USA

来源：

COMBINATORICA | 2006年 / 26卷 / 01期

基金：

美国国家科学基金会;

关键词：

D O I：

10.1007/s00493-006-0008-z

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

We show that the traveling salesman problem with triangle inequality cannot be approximated with a ratio better than (117)/(116) when the edge lengths are allowed to be asymmetric and (220)/(219) when the edge lengths are symmetric, unless P=NP. The best previous lower bounds were (2805)/(2804) and (3813)/(3812) respectively. The reduction is from Hastad's maximum satisfiability of linear equations modulo 2, and is nonconstructive.

引用

页码：101 / 120

页数：20

共 50 条

[1] On The Approximability Of The Traveling Salesman Problem
Christos H. Papadimitriou*
Santosh Vempala†
[J]. Combinatorica, 2006, 26 : 101 - 120
[2] Improved lower bounds on the approximability of the Traveling Salesman Problem
Böckenhauer, HJ
Seibert, S
[J]. RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS, 2000, 34 (03): : 213 - 255
[3] Complexity and approximability of the Euclidean generalized traveling salesman problem in grid clusters
Michael Khachay
Katherine Neznakhina
[J]. Annals of Mathematics and Artificial Intelligence, 2020, 88 : 53 - 69
[4] Complexity and approximability of the Euclidean generalized traveling salesman problem in grid clusters
Khachay, Michael
Neznakhina, Katherine
[J]. ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 2020, 88 (1-3) : 53 - 69
[5] The traveling salesman problem
Punnen, A
[J]. COMPUTERS & OPERATIONS RESEARCH, 1999, 26 (04) : 295 - 296
[6] The traveling salesman problem
Bangert, Patrick D.
[J]. JOURNAL OF MATHEMATICAL PSYCHOLOGY, 2007, 51 (06) : 401 - 402
[7] The traveling salesman problem
Gutin, Gregory
Punnen, Abraham
[J]. DISCRETE OPTIMIZATION, 2006, 3 (01) : 1 - 1
[8] TRAVELING SALESMAN PROBLEM
GROTSCHEL, M
PADBERG, MW
[J]. OPERATIONS RESEARCH, 1975, 23 : B298 - B298
[9] Solving the clustered traveling salesman problem via traveling salesman problem methods
Lu, Yongliang
Hao, Jin-Kao
Wu, Qinghua
[J]. PEERJ COMPUTER SCIENCE, 2022, 7
[10] An efficient transformation of the generalized traveling salesman problem into the traveling salesman problem on digraphs
Dimitrijevic, V
Saric, Z
[J]. INFORMATION SCIENCES, 1997, 102 (1-4) : 105 - 110

← 1 2 3 4 5 →