A constant-factor approximation algorithm for the asymmetric traveling salesman problem

Ola Svensson, Jakub Tarnawski, László A. Végh. A constant-factor approximation algorithm for the asymmetric traveling salesman problem. In Ilias Diakonikolas, David Kempe 0001, Monika Henzinger, editors, Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2018, Los Angeles, CA, USA, June 25-29, 2018. pages 204-213, ACM, 2018. [doi]

Abstract

Abstract is missing.