Better approximation guarantee for Asymmetric TSP
Data Structures and Algorithms
2026-03-17 v1 Combinatorics
Abstract
We improve the approximation ratio for the Asymmetric TSP to less than 15. We also obtain improved ratios for the special case of unweighted digraphs and the generalization where we ask for a minimum-cost tour with given (distinct) endpoints. Moreover, we prove better upper bounds on the integrality ratios of the natural LP relaxations.
Cite
@article{arxiv.2603.14334,
title = {Better approximation guarantee for Asymmetric TSP},
author = {Jens Vygen},
journal= {arXiv preprint arXiv:2603.14334},
year = {2026}
}
Comments
12 pages, 2 figures