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. An O(log n/ log log n)-approximation Algorithm for the Asymmetric Traveling Salesman Problem. In Moses Charikar, editor, Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010, Austin, Texas, USA, January 17-19, 2010. pages 379-389, SIAM, 2010. [doi]

Abstract

Abstract is missing.