Better approximation guarantee for Asymmetric TSP

20260 citationsJournal Articlegreen Open Access

Authors

Jens Vygen · Center for Discrete Mathematics and Theoretical Computer Science

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.

Topics & Keywords

Complexity and Algorithms in Graphs Vehicle Routing Optimization Methods Advanced Graph Theory Research

Publication Details

Published in: ArXiv.org

Field-Weighted Citation Impact: 0.00

Command Palette

Better approximation guarantee for Asymmetric TSP

Authors

Abstract

Topics & Keywords

Publication Details