![]() | Up a level |
Svensson, Ola, Tarnawski, Jakub and Végh, László A. ORCID: 0000-0003-1152-200X
(2020)
A constant-factor approximation algorithm for the asymmetric traveling salesman problem.
Journal of the ACM, 67 (6).
ISSN 0004-5411
Svensson, Ola, Tarnawski, Jakub and Végh, László A. ORCID: 0000-0003-1152-200X
(2018)
Constant factor approximation for ATSP with two edge weights.
Mathematical Programming, 172 (1-2).
pp. 371-397.
ISSN 0025-5610
Svensson, Ola, Tarnawski, Jakub and Végh, László A. ORCID: 0000-0003-1152-200X
(2018)
A constant-factor approximation algorithm for the asymmetric traveling salesman problem.
In:
Proceedings of 50th Annual ACM SIGACT Symposium on the Theory of Computing (STOC’18).
Association for Computing Machinery, New York, NY, pp. 204-213.
ISBN 9781450355599