A new approximation algorithm for the asymmetric TSP with triangle inequality

Open Webpage

Markus Bläser

Published: 2003, Last Modified: 10 May 2024SODA 2003EveryoneRevisionsBibTeXCC 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.