The Internet Archive has a preservation copy of this work in our general collections.
The file type is `application/pdf`

.

##
###
The traveling salesman problem on cubic and subcubic graphs
[article]

2011
*
arXiv
*
pre-print

We study the Travelling Salesman Problem (TSP) on the metric completion of cubic and subcubic graphs, which is known to be NP-hard. The problem is of interest because of its relation to the famous 4/3 conjecture for metric TSP, which says that the integrality gap, i.e., the worst case ratio between the optimal values of the TSP and its linear programming relaxation (the subtour elimination relaxation), is 4/3. We present the first algorithm for cubic graphs with approximation ratio 4/3. The

arXiv:1107.1052v1
fatcat:sbklbt5rebaytnvbpsd7atmd7q