A new approximation algorithm for the asymmetric TSP with triangle inequality

Open Webpage

Markus Bläser

Published: 01 Jan 2008, Last Modified: 10 May 2024ACM Trans. Algorithms 2008EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: We present a polynomial time factor 0.999 ċ log n approximation algorithm for the asymmetric traveling salesperson problem with triangle inequality.