An O(log n/ log log n)-approximation Algorithm for the Asymmetric Traveling Salesman Problem.

Arash Asadpour, Michel X. Goemans, Aleksander Madry, Shayan Oveis Gharan, Amin Saberi

Browse the full SODA paper archive.