Ruixiong Tian, Zhe Xiang, et al.
Qinghua Daxue Xuebao/Journal of Tsinghua University
Paper
An improved upper bound for the TSP in cubic 3-edge-connected graphs
Abstract
We consider the travelling salesman problem (TSP) problem on (the metric completion of) 3-edge-connected cubic graphs. These graphs are interesting because of the connection between their optimal solutions and the subtour elimination LP relaxation. Our main result is an approximation algorithm better than the 3/2-approximation algorithm for TSP in general. © 2004 Elsevier B.V. All rights reserved.
Related
Y.Y. Li, K.S. Leung, et al.
J Combin Optim
Hang-Yip Liu, Steffen Schulze, et al.
Proceedings of SPIE - The International Society for Optical Engineering
Ehud Altman, Kenneth R. Brown, et al.
PRX Quantum