An 8/13-approximation algorithm for the asymmetric maximum TSP

Open Webpage

Markus Bläser

Published: 2002, Last Modified: 10 May 2024SODA 2002EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: We present a polynomial time approximation algorithm for the asymmetric maximum traveling salesperson problem that achieves performance ratio 8/13(1 - 1/n). The running time of our algorithm is O(n3).