{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:42:15Z","timestamp":1775054535646,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,6,20]],"date-time":"2018-06-20T00:00:00Z","timestamp":1529452800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"European Research Council","award":["ERC Starting Grant 335288-OptApprox"],"award-info":[{"award-number":["ERC Starting Grant 335288-OptApprox"]}]},{"name":"Engineering and Physical Sciences Research Council","award":["EPSRC First Grant EP\/M02797X\/1"],"award-info":[{"award-number":["EPSRC First Grant EP\/M02797X\/1"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,6,20]]},"DOI":"10.1145\/3188745.3188824","type":"proceedings-article","created":{"date-parts":[[2018,6,20]],"date-time":"2018-06-20T20:15:46Z","timestamp":1529525746000},"page":"204-213","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":21,"title":["A constant-factor approximation algorithm for the asymmetric traveling salesman problem"],"prefix":"10.1145","author":[{"given":"Ola","family":"Svensson","sequence":"first","affiliation":[{"name":"EPFL, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jakub","family":"Tarnawski","sequence":"additional","affiliation":[{"name":"EPFL, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L\u00e1szl\u00f3 A.","family":"V\u00e9gh","sequence":"additional","affiliation":[{"name":"London School of Economics, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,6,20]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"Shmoys","author":"An Hyung-Chan","year":"2010","unstructured":"Hyung-Chan An , Robert D. Kleinberg , and David B . Shmoys . 2010 . Approximation Algorithms for the Bottleneck Asymmetric Traveling Salesman Problem. In APPROX. 1\u201311. Hyung-Chan An, Robert D. Kleinberg, and David B. Shmoys. 2010. Approximation Algorithms for the Bottleneck Asymmetric Traveling Salesman Problem. In APPROX. 1\u201311."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2015.11"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/1873601.1873633"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1383369.1383378"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1060.0191"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01582008"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74208-1_8"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(74)90091-4"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230120103"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/2133036.2133111"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.80"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1082036.1082041"},{"key":"e_1_3_2_2_14_1","volume-title":"ISAAC","author":"Karpinski Marek","year":"2013","unstructured":"Marek Karpinski , Michael Lampis , and Richard Schmied . 2013 . New Inapproximability Bounds for TSP. In Algorithms and Computation - 24th International Symposium , ISAAC 2013. 568\u2013578. Marek Karpinski, Michael Lampis, and Richard Schmied. 2013. New Inapproximability Bounds for TSP. In Algorithms and Computation - 24th International Symposium, ISAAC 2013. 568\u2013578."},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01564847"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2739008"},{"key":"e_1_3_2_2_17_1","volume-title":"29th International Symposium on Theoretical Aspects of Computer Science, STACS","author":"Mucha Marcin","year":"2012","unstructured":"Marcin Mucha . 2012 . 13\/9-approximation for Graphic TSP . In 29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012. 30\u201341. Marcin Mucha. 2012. 13\/9-approximation for Graphic TSP. In 29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012. 30\u201341."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(84)90077-4"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-014-2960-3"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2015.10"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-33461-5_19"}],"event":{"name":"STOC '18: Symposium on Theory of Computing","location":"Los Angeles CA USA","acronym":"STOC '18","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3188745.3188824","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3188745.3188824","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:07:09Z","timestamp":1750212429000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3188745.3188824"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,20]]},"references-count":20,"alternative-id":["10.1145\/3188745.3188824","10.1145\/3188745"],"URL":"https:\/\/doi.org\/10.1145\/3188745.3188824","relation":{},"subject":[],"published":{"date-parts":[[2018,6,20]]},"assertion":[{"value":"2018-06-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}