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]
@inproceedings{SvenssonTV18,
title = {A constant-factor approximation algorithm for the asymmetric traveling salesman problem},
author = {Ola Svensson and Jakub Tarnawski and László A. Végh},
year = {2018},
doi = {10.1145/3188745.3188824},
url = {http://doi.acm.org/10.1145/3188745.3188824},
researchr = {https://researchr.org/publication/SvenssonTV18},
cites = {0},
citedby = {0},
pages = {204-213},
booktitle = {Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2018, Los Angeles, CA, USA, June 25-29, 2018},
editor = {Ilias Diakonikolas and David Kempe 0001 and Monika Henzinger},
publisher = {ACM},
}