@InProceedings{marx_et_al:LIPIcs.APPROX-RANDOM.2016.16,
  author =	{Marx, D\'{a}niel and Salmasi, Ario and Sidiropoulos, Anastasios},
  title =	{{Constant-Factor Approximations for Asymmetric TSP on Nearly-Embeddable Graphs}},
  booktitle =	{Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016)},
  pages =	{16:1--16:54},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-018-7},
  ISSN =	{1868-8969},
  year =	{2016},
  volume =	{60},
  editor =	{Jansen, Klaus and Mathieu, Claire and Rolim, Jos\'{e} D. P. and Umans, Chris},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2016.16},
  URN =		{urn:nbn:de:0030-drops-66391},
  doi =		{10.4230/LIPIcs.APPROX-RANDOM.2016.16},
  annote =	{Keywords: asymmetric TSP, approximation algorithms, nearly-embeddable graphs, Held-Karp LP, exponential time hypothesis}
}