## Abstract

We show improved approximation guarantees for the traveling salesman problem on cubic bipartite graphs and cubic graphs. For connected cubic bipartite graphs with *n* nodes, we improve on recent results of Karp and Ravi by giving a “local improvement” algorithm that finds a tour of length at most \(5/4n-2\). For 2-connected cubic graphs, we show that the techniques of Mömke and Svensson can be combined with the techniques of Correa, Larré and Soto, to obtain a tour of length at most \((4/3-1/8754)n\).

### Similar content being viewed by others

## References

Aggarwal, N., Garg, N., Gupta, S.: A 4/3-approximation for TSP on cubic 3-edge-connected graphs. http://arxiv.org/abs/1101.5586 (2011)

Barnette, D.: Conjecture 5. In: Tutte, W.T. (ed.) Recent progress in combinatorics: proceedings of the third waterloo conference on combinatorics, May 1968. Academic Press, New York (1969)

Boyd, S., Sitters, R., van der Ster, S., Stougie, L.: The traveling salesman problem on cubic and subcubic graphs. Math. Program.

**144**(1–2), 227–245 (2014)Candráková, B., Lukotka, R.: Cubic TSP—a 1.3-approximation. CoRR, abs/1506.06369 (2015)

Christofides, N.: Worst Case Analysis of a New Heuristic for the Traveling Salesman Problem. Report 388, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh (1976)

Correa, J., Larré, O., Soto, J.: TSP tours in cubic graphs: beyond 4/3. SIAM J. Discrete Math.

**29**(2), 915–939 (2015) (Preliminary version appeared in ESA 2012: 790-801)Dantzig, G.B., Fulkerson, D.R., Johnson, S.M.: Solution of a large-scale traveling-salesman problem. Oper. Res.

**2**, 393–410 (1954)Gamarnik, D., Lewenstein, M., Sviridenko, M.: An improved upper bound for the TSP in cubic 3-edge-connected graphs. Oper. Res. Lett.

**33**(5), 467–474 (2005)Held, M., Karp, R.M.: The traveling-salesman problem and minimum spanning trees. Oper. Res.

**18**, 1138–1162 (1970)Karp, J., Ravi, R.: A 9/7-approximation algorithm for graphic TSP in cubic bipartite graphs. Discrete Appl. Math.

**209**, 164–216 (2016) (Preliminary version appeared in (APPROX-RANDOM 2014): pp. 284–296, 2014)Mömke, T., Svensson, O.: Removing and adding edges for the traveling salesman problem. J. ACM

**63**(1), 2 (2016) (Preliminary version appeared in FOCS 2011: pp. 560–569, 2011)Mucha, M.: 13/9 -approximation for graphic TSP. Theory Comput. Syst.

**55**(4), 640–657 (2014) (Preliminary version appeared in STACS 2012: 30–41, 2012)Petersen, J.: Die Theorie der regulären graphs. Acta Math.

**15**, 193–220 (1891)Sebő, A., Vygen, J.: Shorter tours by nicer ears: 7/5-approximation for the graph-TSP, 3/2 for the path version, and 4/3 for two-edge-connected subgraphs. Combinatorica

**34**(5), 597–629 (2014)

## Acknowledgements

The author would like to thank Marcin Mucha for careful reading and pointing out an omission in a previous version, Frans Schalekamp for helpful discussions, and an anonymous reviewer for suggesting the simplified proof for the result in Sect. 3 for cubic non-bipartite graphs. Other anonymous reviewers are acknowledged for helpful feedback on the presentation of the algorithm for bipartite cubic graphs.

## Author information

### Authors and Affiliations

### Corresponding author

## Additional information

Supported in part by NSF Prime Award: HRD-1107147, Women in Scientific Education (WISE) and by a Grant from the Simons Foundation (#359525, Anke Van Zuylen).

## A Tightness of the analysis of Algorithm 1

### A Tightness of the analysis of Algorithm 1

We give an example of a cubic bipartite graph \(G=(V, E)\) for which both the 2-factors \(F_1\) and \(F_2\) that result from Algorithm 1 have |*V*| / 8 components.

The instance has 48 nodes, numbered 1 through 48, and \((V, F_1)\) contains six cycles, four cycles of size 6, one cycle of size 10 and one cycle of size 14. For brevity, we denote the cycles by only giving an ordered listing of their nodes; an edge between consecutive nodes and between the last and first node is implicit. The cycles in \((V, F_1)\) are:

The second 2-factor \((V,F_2)\) has six cycles as well, namely, three cycles of size 6 and three cycles of size 10. We again denote the cycles by giving an ordered listing of the nodes, but now a semicolon between subsequent nodes indicates that the nodes are connected by an edge in \(F_2{\setminus } F_1\), and a comma denotes that they are connected by an edge in \(F_2\cap F_1\). The cycles in \((V, F_2)\) are

It is straightforward to verify that every node occurs in exactly one cycle in \((V, F_1)\) and exactly one cycle in \((V, F_2)\), and that each cycle in \((V, F_1)\) alternates edges in \(F_1{\setminus } F_2\) and edges in \(F_1\cap F_2\), and that each cycle in \((V, F_2)\) alternates edges in \(F_2\cap F_1\) and edges in \(F_2{\setminus } F_1\). Furthermore, each cycle \(C_i\) in \((V, F_1)\) has exactly two edges in a cycle *D* in \((V, F_2)\) of size exactly 10.

*Local Optimum*

Figure 3 depicts each of the six cycles \(C_i\) in \((V, F_1)\), together with the cycles \(D_j\) in \((V,F_2)\) that intersect the given cycle \(C_i\). For any of the cycles \(C_i\), replacing \(F_2\) by \(F_2\triangle E(C_i)\) does not decrease the number of components of \((V, F_2)\) for any cycle \(C_i\), nor does the modification of \(F_2\) for a chorded cycle described in Algorithm 1.

Hence, if, rather than following Algorithm 1, we would execute one of the two possible modifications of \(F_2\) suggested by the algorithm, as long as this reduced the number of components of \((V, F_2)\), then the 2-factor \(F_2\) is in fact a local optimum with respect to this process since none of the possible modifications reduces the number of components.

We note that the instance does have a Hamilton cycle. This cycle contains subpaths of more than two adjacent edges in \(E{\setminus } F_1\), so it can never be found from \(F_1\) and \(F_2\) using the “moves” we defined, even if we allow “moves” that do not reduce the number of components of \((V, F_2)\). We give the Hamilton cycle by again giving an ordered listing of the nodes, where a semicolon between subsequent nodes indicates that the nodes are connected by an edge in \(E{\setminus } F_1\), and a comma denotes that they are connected by an edge in \(F_1\).

## Rights and permissions

## About this article

### Cite this article

van Zuylen, A. Improved approximations for cubic bipartite and cubic TSP.
*Math. Program.* **172**, 399–413 (2018). https://doi.org/10.1007/s10107-017-1211-y

Received:

Accepted:

Published:

Issue Date:

DOI: https://doi.org/10.1007/s10107-017-1211-y

### Keywords

- Traveling salesman problem
- Approximation algorithm
- Cubic bipartite graphs
- Cubic graphs
- Barnette’s conjecture