@InProceedings{svensson:LIPIcs.FSTTCS.2018.3,
author = {Svensson, Ola},
title = {{Algorithms for the Asymmetric Traveling Salesman Problem}},
booktitle = {38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018)},
pages = {3:1--3:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-093-4},
ISSN = {1868-8969},
year = {2018},
volume = {122},
editor = {Ganguly, Sumit and Pandya, Paritosh},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2018.3},
URN = {urn:nbn:de:0030-drops-99024},
doi = {10.4230/LIPIcs.FSTTCS.2018.3},
annote = {Keywords: Approximation algorithms, combinatorial optimization, linear programming, traveling salesman problem}
}