{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:42:14Z","timestamp":1775054534223,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":13,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,6,22]],"date-time":"2020-06-22T00:00:00Z","timestamp":1592784000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,6,22]]},"DOI":"10.1145\/3357713.3384233","type":"proceedings-article","created":{"date-parts":[[2020,6,7]],"date-time":"2020-06-07T01:45:25Z","timestamp":1591494325000},"page":"1-13","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":17,"title":["An improved approximation algorithm for ATSP"],"prefix":"10.1145","author":[{"given":"Vera","family":"Traub","sequence":"first","affiliation":[{"name":"University of Bonn, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jens","family":"Vygen","sequence":"additional","affiliation":[{"name":"University of Bonn, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,6,22]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science (FOCS 2012 ), 20-39","author":"Anari N","unstructured":"Anari , N , and Oveis Gharan , S. : Efective-resistance-reducing flows, spectrally thin trees, and asymmetric TSP . Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science (FOCS 2012 ), 20-39 Anari, N, and Oveis Gharan, S. : Efective-resistance-reducing flows, spectrally thin trees, and asymmetric TSP. Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science (FOCS 2012 ), 20-39"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2017.1603"},{"key":"e_1_3_2_1_3_1","volume-title":"Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2003 ), 638-645","author":"Bl\u00e4ser M.","unstructured":"Bl\u00e4ser , M. : A new approximation algorithm for the asymmetric TSP with triangle inequality . Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2003 ), 638-645 Bl\u00e4ser, M. : A new approximation algorithm for the asymmetric TSP with triangle inequality. Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2003 ), 638-645"},{"key":"e_1_3_2_1_4_1","first-page":"245","volume":"31","author":"Charikar M.","unstructured":"Charikar , M. , Goemans , M.X. , and Karlof , H. [ 2006 ]: On the integrality ratio for the asymmetric traveling salesman problem. Mathematics of Operations Research 31 ( 2006 ), 245 - 252 Charikar, M., Goemans, M.X., and Karlof, H. [ 2006 ]: On the integrality ratio for the asymmetric traveling salesman problem. Mathematics of Operations Research 31 ( 2006 ), 245-252","journal-title":"Operations Research"},{"key":"e_1_3_2_1_5_1","first-page":"104","volume-title":"Proceedings of the 10th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems; LNCS 4627 (M. Charikar, K. Jansen, O. Reingold, J.D.P. Rolim, eds.)","author":"Feige U.","year":"2007","unstructured":"Feige , U. , and Singh , M . : Improved approximation algorithms for traveling salesperson tours and paths in directed graphs . Proceedings of the 10th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems; LNCS 4627 (M. Charikar, K. Jansen, O. Reingold, J.D.P. Rolim, eds.) , Springer, Berlin 2007 , pp. 104 - 118 Feige, U., and Singh, M. : Improved approximation algorithms for traveling salesperson tours and paths in directed graphs. Proceedings of the 10th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems; LNCS 4627 (M. Charikar, K. Jansen, O. Reingold, J.D.P. Rolim, eds.), Springer, Berlin 2007, pp. 104-118"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230120103"},{"key":"e_1_3_2_1_7_1","first-page":"602","volume":"52","author":"Kaplan H.","unstructured":"Kaplan , H. , Lewenstein , M. , Shafrir , N. , and Sviridenko , M. : Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs. Journal of the ACM 52 ( 2005 ), 602 - 626 Kaplan, H., Lewenstein, M., Shafrir, N., and Sviridenko, M. : Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs. Journal of the ACM 52 ( 2005 ), 602-626","journal-title":"ACM"},{"key":"e_1_3_2_1_8_1","first-page":"288","volume-title":"[ 2019 ]: The asymmetric traveling salesman path LP has constant integrality ratio. Mathematical Programming, to appear. Preliminary version in: Integer Programming and Combinatorial Optimization","author":"K\u00f6hne A.","year":"2019","unstructured":"K\u00f6hne , A. , Traub , V. , and Vygen , J . [ 2019 ]: The asymmetric traveling salesman path LP has constant integrality ratio. Mathematical Programming, to appear. Preliminary version in: Integer Programming and Combinatorial Optimization ; Proceedings of the 20th International IPCO Conference; LNCS 11480 (A. Lodi, V. Nagarajan, eds.), Springer , Cham 2019 , pp. 288 - 298 K\u00f6hne, A., Traub, V., and Vygen, J. [ 2019 ]: The asymmetric traveling salesman path LP has constant integrality ratio. Mathematical Programming, to appear. Preliminary version in: Integer Programming and Combinatorial Optimization; Proceedings of the 20th International IPCO Conference; LNCS 11480 (A. Lodi, V. Nagarajan, eds.), Springer, Cham 2019, pp. 288-298"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2015.10"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-017-1195-7"},{"key":"e_1_3_2_1_11_1","volume-title":"[ 2019 ] : A constant-factor approximation algorithm for the asymmetric traveling salesman problem. arXiv:1708.04215v3","author":"Svensson O.","year":"2018","unstructured":"Svensson , O. , Tarnawski , J. , and V\u00e9gh , L . [ 2019 ] : A constant-factor approximation algorithm for the asymmetric traveling salesman problem. arXiv:1708.04215v3 ; Preliminary version in the Proceedings of the 50th Annual ACM Symposium on the Theory of Computing ( 2018 ), 204-213 Svensson, O., Tarnawski, J., and V\u00e9gh, L. [ 2019 ] : A constant-factor approximation algorithm for the asymmetric traveling salesman problem. arXiv:1708.04215v3; Preliminary version in the Proceedings of the 50th Annual ACM Symposium on the Theory of Computing ( 2018 ), 204-213"},{"key":"e_1_3_2_1_12_1","volume-title":"Approximating Algorithms for Traveling Salesman Problems. Dissertation","author":"Traub V.","unstructured":"Traub , V. [ 2020 ] : Approximating Algorithms for Traveling Salesman Problems. Dissertation , University of Bonn. Traub, V. [ 2020 ] : Approximating Algorithms for Traveling Salesman Problems. Dissertation, University of Bonn."},{"key":"e_1_3_2_1_13_1","volume-title":"[ 2019 ] : An improved approximation algorithm for ATSP. arXiv","author":"Traub V.","year":"1912","unstructured":"Traub , V. , and Vygen , J . [ 2019 ] : An improved approximation algorithm for ATSP. arXiv : 1912 .00670 Traub, V., and Vygen, J. [ 2019 ] : An improved approximation algorithm for ATSP. arXiv: 1912.00670"}],"event":{"name":"STOC '20: 52nd Annual ACM SIGACT Symposium on Theory of Computing","location":"Chicago IL USA","acronym":"STOC '20","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3357713.3384233","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3357713.3384233","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:41:12Z","timestamp":1750200072000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3357713.3384233"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,22]]},"references-count":13,"alternative-id":["10.1145\/3357713.3384233","10.1145\/3357713"],"URL":"https:\/\/doi.org\/10.1145\/3357713.3384233","relation":{},"subject":[],"published":{"date-parts":[[2020,6,22]]},"assertion":[{"value":"2020-06-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}