{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:41:56Z","timestamp":1775054516660,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":43,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,5,19]],"date-time":"2012-05-19T00:00:00Z","timestamp":1337385600000},"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":[[2012,5,19]]},"DOI":"10.1145\/2213977.2214038","type":"proceedings-article","created":{"date-parts":[[2012,5,21]],"date-time":"2012-05-21T15:20:35Z","timestamp":1337613635000},"page":"663-672","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":27,"title":["The traveling salesman problem"],"prefix":"10.1145","author":[{"given":"Yair","family":"Bartal","sequence":"first","affiliation":[{"name":"Hebrew University, Jerusalem, Israel"}]},{"given":"Lee-Ad","family":"Gottlieb","sequence":"additional","affiliation":[{"name":"Hebrew University, Jerusalem, Israel"}]},{"given":"Robert","family":"Krauthgamer","sequence":"additional","affiliation":[{"name":"Weizmann Institute, Rehovot, Israel"}]}],"member":"320","published-online":{"date-parts":[[2012,5,19]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"Princeton University Press","author":"Applegate D. L.","year":"2007"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/1347082.1347122"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"crossref","unstructured":"I. Abraham Y. Bartal and O. Neiman. Advances in metric embedding theory. Advances in Mathematics} 228(6):3026 -- 3126 2011.  I. Abraham Y. Bartal and O. Neiman. Advances in metric embedding theory. Advances in Mathematics} 228(6):3026 -- 3126 2011.","DOI":"10.1016\/j.aim.2011.08.003"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835698.1835743"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/290179.290180"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276718"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.24033\/bsmf.1997"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/874062.875536"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276725"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/2133036.2133104"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-011-9337-9"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132599"},{"key":"e_1_3_2_2_13_1","first-page":"690","volume-title":"19th annual ACM-SIAM symposium on Discrete algorithms","author":"Chan T.-H. H.","year":"2008"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/1347082.1347119"},{"key":"e_1_3_2_2_15_1","volume-title":"Carnegie-Mellon Univ. Management Sciences Research Group","author":"Christofides N.","year":"1976"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/646252.686175"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"crossref","unstructured":"K. L. Clarkson. Nearest neighbor queries in metric spaces. Discrete Comput. Geom.} 22(1):63--93 1999.  K. L. Clarkson. Nearest neighbor queries in metric spaces. Discrete Comput. Geom.} 22(1):63--93 1999.","DOI":"10.1007\/PL00009449"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/646255.684588"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780608"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2005.10.001"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/2133036.2133105"},{"key":"e_1_3_2_2_22_1","first-page":"433","volume-title":"23rd Conference on Learning Theory}","author":"Gottlieb L.-A.","year":"2010"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/946243.946308"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(92)90069-F"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87744-8_40"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"e_1_3_2_2_27_1","first-page":"791","volume-title":"15th Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Krauthgamer R.","year":"2004"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702404055"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"crossref","unstructured":"T. J. Laakso. Ahlfors Q-regular spaces with arbitrary Q>1 admitting weak Poincar'e inequality. Geom. Funct. Anal.} 10(1):111--123 2000.  T. J. Laakso. Ahlfors Q-regular spaces with arbitrary Q>1 admitting weak Poincar'e inequality. Geom. Funct. Anal.} 10(1):111--123 2000.","DOI":"10.1007\/s000390050003"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1112\/S0024609302001200"},{"key":"e_1_3_2_2_31_1","unstructured":"J. R. Lee. The Godel prize TSP and volume growth (blog post). http:\/\/tcsmath.wordpress.com\/2010\/06\/24\/the-godel-prize-tsp-and-volume-growth June 2010.  J. R. Lee. The Godel prize TSP and volume growth (blog post). http:\/\/tcsmath.wordpress.com\/2010\/06\/24\/the-godel-prize-tsp-and-volume-growth June 2010."},{"key":"e_1_3_2_2_32_1","unstructured":"E. L. Lawler J. K. Lenstra A. H. G. R. Kan and D. B. Shmoys editors. The Traveling Salesman Problem. Wiley-Interscience series in discrete mathematics 1985.  E. L. Lawler J. K. Lenstra A. H. G. R. Kan and D. B. Shmoys editors. The Traveling Salesman Problem. Wiley-Interscience series in discrete mathematics 1985."},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"crossref","unstructured":"U. Lang and C. Plaut. Bilipschitz embeddings of metric spaces into space forms. Geom. Dedicata 87(1--3):285--307 2001.  U. Lang and C. Plaut. Bilipschitz embeddings of metric spaces into space forms. Geom. Dedicata 87(1--3):285--307 2001.","DOI":"10.1023\/A:1012093209450"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539796309764"},{"key":"e_1_3_2_2_35_1","first-page":"11","volume-title":"8th Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Mitchell J. S. B.","year":"2007"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(77)90012-3"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-006-0008-z"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.18.1.1"},{"key":"e_1_3_2_2_39_1","unstructured":"G.\n       \n      Reinelt\n    . \n      \n      \n      The Traveling\n       \n      Salesman volume \n  840\n   of \n  Lecture Notes in Computer Science\n  . \n  Springer-Verlag Berlin 1994\n  .  G. Reinelt. The Traveling Salesman volume 840 of Lecture Notes in Computer Science. Springer-Verlag Berlin 1994."},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276868"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"crossref","unstructured":"M. Smid. On some combinatorial problems in metric spaces of bounded doubling dimension. Manuscript available at http:\/\/people.scs.carleton.ca\/ michiel\/research.html 2010.  M. Smid. On some combinatorial problems in metric spaces of bounded doubling dimension. Manuscript available at http:\/\/people.scs.carleton.ca\/ michiel\/research.html 2010.","DOI":"10.1007\/978-3-642-03456-5_19"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007399"},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539799352735"}],"event":{"name":"STOC'12: Symposium on Theory of Computing","location":"New York New York USA","acronym":"STOC'12","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the forty-fourth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2213977.2214038","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2213977.2214038","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:20:54Z","timestamp":1750238454000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2213977.2214038"}},"subtitle":["low-dimensionality implies a polynomial time approximation scheme"],"short-title":[],"issued":{"date-parts":[[2012,5,19]]},"references-count":43,"alternative-id":["10.1145\/2213977.2214038","10.1145\/2213977"],"URL":"https:\/\/doi.org\/10.1145\/2213977.2214038","relation":{},"subject":[],"published":{"date-parts":[[2012,5,19]]},"assertion":[{"value":"2012-05-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}