Document

# Towards Improving Christofides Algorithm for Half-Integer TSP

## File

LIPIcs.ESA.2019.56.pdf
• Filesize: 0.49 MB
• 12 pages

## Acknowledgements

We thank R. Ravi for comments on the presentation of this paper.

## Cite As

Arash Haddadan and Alantha Newman. Towards Improving Christofides Algorithm for Half-Integer TSP. In 27th Annual European Symposium on Algorithms (ESA 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 144, pp. 56:1-56:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
https://doi.org/10.4230/LIPIcs.ESA.2019.56

## Abstract

We study the traveling salesman problem (TSP) in the case when the objective function of the subtour linear programming relaxation is minimized by a half-cycle point: x_e in {0,1/2,1} where the half-edges form a 2-factor and the 1-edges form a perfect matching. Such points are sufficient to resolve half-integer TSP in general and they have been conjectured to demonstrate the largest integrality gap for the subtour relaxation. For half-cycle points, the best-known approximation guarantee is 3/2 due to Christofides' famous algorithm. Proving an integrality gap of alpha for the subtour relaxation is equivalent to showing that alpha x can be written as a convex combination of tours, where x is any feasible solution for this relaxation. To beat Christofides' bound, our goal is to show that (3/2 - epsilon)x can be written as a convex combination of tours for some positive constant epsilon. Let y_e = 3/2-epsilon when x_e = 1 and y_e = 3/4 when x_e = 1/2. As a first step towards this goal, our main result is to show that y can be written as a convex combination of tours. In other words, we show that we can save on 1-edges, which has several applications. Among them, it gives an alternative algorithm for the recently studied uniform cover problem. Our main new technique is a procedure to glue tours over proper 3-edge cuts that are tight with respect to x, thus reducing the problem to a base case in which such cuts do not occur.

## Subject Classification

##### ACM Subject Classification
• Mathematics of computing → Combinatorial optimization
##### Keywords
• Traveling salesman problem
• subtour elimination relaxation
• integrality gap
• gluing subtours

## Metrics

• Access Statistics
• Total Accesses (updated on a weekly basis)
0

## References

1. Michel L. Balinski. Integer programming: Methods, uses, computations. Management Science, 12(3):253-313, 1965.
2. Sylvia Boyd and Robert Carr. Finding low cost TSP and 2-matching solutions using certain half-integer subtour vertices. Discrete Optimization, 8(4):525-539, 2011.
3. Sylvia Boyd and Philippe Legault. Toward a 6/5 Bound for the Minimum Cost 2-Edge Connected Spanning Subgraph. SIAM Journal on Discrete Mathematics, 31(1):632-644, 2017.
4. Sylvia Boyd and András Sebő. The Salesman’s Improved Tours for Fundamental Classes. In Proceedings of 19th International Conference on Integer Programming and Combinatorial Optimization (IPCO), pages 111-122, 2017.
5. Robert Carr and R. Ravi. A new bound for the 2-edge connected subgraph problem. In Proceedings of 6th International Conference on Integer Programming and Combinatorial Optimization (IPCO), pages 112-125, 1998.
6. Robert Carr and Santosh Vempala. On the Held-Karp relaxation for the asymmetric and symmetric traveling salesman problems. Mathematical Programming, 100(3):569-587, 2004.
7. Nicos Christofides. Worst-case analysis of a new heuristic for the travelling salesman problem. Technical Report 388, Graduate School of Industrial Administration, Carnegie Mellon University, 1976.
8. Gerard Cornuejols, Denis Naddef, and William Pulleyblank. The traveling salesman problem in graphs with 3-edge cutsets. Journal of the ACM, 32(2):383-410, 1985.
9. George Dantzig, Ray Fulkerson, and Selmer Johnson. Solution of a large-scale traveling-salesman problem. Journal of the Operations Research Society of America, 2(4):393-410, 1954.
10. Jack Edmonds and Ellis L. Johnson. Matching, Euler tours and the Chinese postman. Mathematical Programming, 5(1):88-124, 1973.
11. Arash Haddadan and Alantha Newman. Efficient constructions of convex combinations for 2-edge-connected subgraphs on fundamental classes. CoRR, abs/1811.09906, 2018. URL: http://arxiv.org/abs/1811.09906.
12. Arash Haddadan and Alantha Newman. Towards improving Christofides algorithm for half-integer TSP. CoRR, abs/1907.02120, 2019. URL: http://arxiv.org/abs/1907.02120.
13. Arash Haddadan, Alantha Newman, and R. Ravi. Shorter tours and longer detours: Uniform covers and a bit beyond. CoRR, abs/1707.05387, 2017. URL: http://arxiv.org/abs/1707.05387.
14. Philippe Legault. Towards new bounds for the 2-edge connected spanning subgraph problem. Master’s thesis, University of Ottawa, 2017.
15. Tobias Mömke and Ola Svensson. Removing and adding edges for the traveling salesman problem. Journal of the ACM, 63(1):2, 2016.
16. Shayan Oveis Gharan, Amin Saberi, and Mohit Singh. A randomized rounding approach to the traveling salesman problem. In Proceedings of the 52nd Annual Symposium on Foundations of Computer Science (FOCS), pages 550-559, 2011.
17. Frans Schalekamp, David P. Williamson, and Anke van Zuylen. 2-matchings, the traveling salesman problem, and the subtour LP: A proof of the Boyd-Carr conjecture. Mathematics of Operations Research, 39(2):403-417, 2013.
18. András Sebő, Yohann Benchetrit, and Matej Stehlik. Problems about uniform covers, with tours and detours. Mathematisches Forschungsinstitut Oberwolfach Report, 51:2912 - -2915, 2014.
19. András Sebő and Jens Vygen. 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.
20. David B. Shmoys and David P. Williamson. Analyzing the Held-Karp TSP bound: A monotonicity property with application. Information Processing Letters, 35(6):281-285, 1990.
21. Laurence A. Wolsey. Heuristic analysis, linear programming and branch and bound, pages 121-134. Springer Berlin Heidelberg, 1980.