{"id":"https://openalex.org/W2028047126","doi":"https://doi.org/10.1145/2213977.2214038","title":"The traveling salesman problem","display_name":"The traveling salesman problem","publication_year":2012,"publication_date":"2012-05-19","ids":{"openalex":"https://openalex.org/W2028047126","doi":"https://doi.org/10.1145/2213977.2214038","mag":"2028047126"},"language":"en","primary_location":{"id":"doi:10.1145/2213977.2214038","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2213977.2214038","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-fourth annual ACM symposium on Theory of computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5111723795","display_name":"Yair Bartal","orcid":null},"institutions":[{"id":"https://openalex.org/I197251160","display_name":"Hebrew University of Jerusalem","ror":"https://ror.org/03qxff017","country_code":"IL","type":"education","lineage":["https://openalex.org/I197251160"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Yair Bartal","raw_affiliation_strings":["Hebrew University, Jerusalem, Israel","Hebrew University , Jerusalem, Israel"],"affiliations":[{"raw_affiliation_string":"Hebrew University, Jerusalem, Israel","institution_ids":["https://openalex.org/I197251160"]},{"raw_affiliation_string":"Hebrew University , Jerusalem, Israel","institution_ids":["https://openalex.org/I197251160"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5057494907","display_name":"Lee-Ad Gottlieb","orcid":"https://orcid.org/0000-0003-3355-351X"},"institutions":[{"id":"https://openalex.org/I197251160","display_name":"Hebrew University of Jerusalem","ror":"https://ror.org/03qxff017","country_code":"IL","type":"education","lineage":["https://openalex.org/I197251160"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Lee-Ad Gottlieb","raw_affiliation_strings":["Hebrew University, Jerusalem, Israel","Hebrew University , Jerusalem, Israel"],"affiliations":[{"raw_affiliation_string":"Hebrew University, Jerusalem, Israel","institution_ids":["https://openalex.org/I197251160"]},{"raw_affiliation_string":"Hebrew University , Jerusalem, Israel","institution_ids":["https://openalex.org/I197251160"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5037378898","display_name":"Robert Krauthgamer","orcid":"https://orcid.org/0009-0003-8154-3735"},"institutions":[{"id":"https://openalex.org/I53964585","display_name":"Weizmann Institute of Science","ror":"https://ror.org/0316ej306","country_code":"IL","type":"education","lineage":["https://openalex.org/I53964585"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Robert Krauthgamer","raw_affiliation_strings":["Weizmann Institute, Rehovot, Israel"],"affiliations":[{"raw_affiliation_string":"Weizmann Institute, Rehovot, Israel","institution_ids":["https://openalex.org/I53964585"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5111723795"],"corresponding_institution_ids":["https://openalex.org/I197251160"],"apc_list":null,"apc_paid":null,"fwci":5.8102,"has_fulltext":false,"cited_by_count":105,"citation_normalized_percentile":{"value":0.96684947,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"663","last_page":"672"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9973000288009644,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9973000288009644,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9968000054359436,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9966999888420105,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.8804351091384888},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.591298520565033},{"id":"https://openalex.org/keywords/traveling-purchaser-problem","display_name":"Traveling purchaser problem","score":0.538895308971405},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.5313264727592468},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.4382956027984619},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.37673264741897583},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2127733826637268},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1941160261631012}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8804351091384888},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.591298520565033},{"id":"https://openalex.org/C4331618","wikidata":"https://www.wikidata.org/wiki/Q7836034","display_name":"Traveling purchaser problem","level":4,"score":0.538895308971405},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.5313264727592468},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.4382956027984619},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.37673264741897583},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2127733826637268},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1941160261631012}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2213977.2214038","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2213977.2214038","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-fourth annual ACM symposium on Theory of computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":46,"referenced_works":["https://openalex.org/W16274536","https://openalex.org/W100489996","https://openalex.org/W1515796352","https://openalex.org/W1594954118","https://openalex.org/W1727427879","https://openalex.org/W1769399376","https://openalex.org/W1977541023","https://openalex.org/W1981306975","https://openalex.org/W1983067644","https://openalex.org/W1994248285","https://openalex.org/W1995718774","https://openalex.org/W1998441894","https://openalex.org/W2000234319","https://openalex.org/W2007279610","https://openalex.org/W2017427469","https://openalex.org/W2020284736","https://openalex.org/W2034188144","https://openalex.org/W2041215255","https://openalex.org/W2041571997","https://openalex.org/W2053578961","https://openalex.org/W2054575839","https://openalex.org/W2055569927","https://openalex.org/W2059222268","https://openalex.org/W2071247529","https://openalex.org/W2082353536","https://openalex.org/W2083854723","https://openalex.org/W2105160468","https://openalex.org/W2114493937","https://openalex.org/W2117226423","https://openalex.org/W2127248062","https://openalex.org/W2141355868","https://openalex.org/W2142266972","https://openalex.org/W2144397897","https://openalex.org/W2145057516","https://openalex.org/W2165142526","https://openalex.org/W2208163925","https://openalex.org/W2401610261","https://openalex.org/W2547651473","https://openalex.org/W2583644876","https://openalex.org/W2620916615","https://openalex.org/W2729451965","https://openalex.org/W3122195186","https://openalex.org/W3123213514","https://openalex.org/W3138698442","https://openalex.org/W3149604617","https://openalex.org/W4241226388"],"related_works":["https://openalex.org/W4389782626","https://openalex.org/W4376138746","https://openalex.org/W2359992618","https://openalex.org/W2361554335","https://openalex.org/W4220987199","https://openalex.org/W2171568915","https://openalex.org/W2362402143","https://openalex.org/W2265604726","https://openalex.org/W2033053473","https://openalex.org/W2495211334"],"abstract_inverted_index":{"The":[0],"Traveling":[1],"Salesman":[2],"Problem":[3],"(TSP)":[4],"is":[5],"among":[6],"the":[7,27],"most":[8],"famous":[9],"NP-hard":[10],"optimization":[11],"problems.":[12],"We":[13],"design":[14],"for":[15,30],"this":[16],"problem":[17],"a":[18,24],"randomized":[19],"polynomial-time":[20],"algorithm":[21],"that":[22,37],"computes":[23],"(1+\u00b5)-approximation":[25],"to":[26],"optimal":[28],"tour,":[29],"any":[31],"fixed":[32],"\u00b5>0,":[33],"in":[34],"TSP":[35],"instances":[36],"form":[38],"an":[39],"arbitrary":[40],"metric":[41],"space":[42],"with":[43],"bounded":[44],"intrinsic":[45],"dimension.":[46]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":11},{"year":2023,"cited_by_count":12},{"year":2022,"cited_by_count":12},{"year":2021,"cited_by_count":10},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":7},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}