An improved upper bound for the TSP in cubic 3-edge-connected graphs

Authors:
David Gamarnik;Moshe Lewenstein;Maxim Sviridenko
Affiliations:
IBM T. J. Watson Research Center, Yorktown Heights, P.O. Box 218, NY 10598, USA;Department of Computer Science, Bar Ilan University, Room 323, Mailbox 50, Ramat Gan 52900, Israel;IBM T. J. Watson Research Center, Yorktown Heights, P.O. Box 218, NY 10598, USA
Venue:
Operations Research Letters
Year:
2005

Citing 4
Cited 3

Analyzing the Held-Karp TSP bound: a monotonicity property with application

Information Processing Letters
The traveling salesman problem with distances one and two

Mathematics of Operations Research
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems

Journal of the ACM (JACM)
A polynomial-time approximation scheme for weighted planar graph TSP

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms

Not being (super)thin or solid is hard: A study of grid Hamiltonicity

Computational Geometry: Theory and Applications
TSP on cubic and subcubic graphs

IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
TSP tours in cubic graphs: beyond 4/3

ESA'12 Proceedings of the 20th Annual European conference on Algorithms

Quantified Score

Hi-index	0.00

Visualization

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.