An 8/13-approximation algorithm for the asymmetric maximum TSP
Markus Bläser · Symposium on Discrete Algorithms · 2002
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).