John R. Kender, Rick Kjeldsen
IEEE Transactions on Pattern Analysis and Machine Intelligence
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
Michael E. Henderson
International Journal of Bifurcation and Chaos in Applied Sciences and Engineering
L Auslander, E Feig, et al.
Advances in Applied Mathematics
Richard M. Karp, Raymond E. Miller
Journal of Computer and System Sciences