The Salesman's Improved Paths: A 3/2+1/34 Approximation


We give a new, strongly polynomial algorithm and improved analysis of the metric s-t path TSP. It finds a tour of cost less than 1.53 times the optimum of the subtour elimination LP, while known examples show that 1.5 is a lower bound for the integrality gap. A key new idea is the deletion of some edges of Christofides' trees, and we show that the arising… (More)
DOI: 10.1109/FOCS.2016.21


  • Presentations referencing similar topics