TY - JOUR
T1 - An improved upper bound for the TSP in cubic 3-edge-connected graphs
AU - Gamarnik, David
AU - Lewenstein, Moshe
AU - Sviridenko, Maxim
PY - 2005/9
Y1 - 2005/9
N2 - 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.
AB - 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.
KW - Approximation algorithms
KW - Graphs
KW - Regular graphs
KW - Travelling salesman problem
UR - http://www.scopus.com/inward/record.url?scp=19944415921&partnerID=8YFLogxK
U2 - 10.1016/j.orl.2004.09.005
DO - 10.1016/j.orl.2004.09.005
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:19944415921
SN - 0167-6377
VL - 33
SP - 467
EP - 474
JO - Operations Research Letters
JF - Operations Research Letters
IS - 5
ER -