{"id":"https://openalex.org/W2055038236","doi":"https://doi.org/10.1137/0211003","title":"A Fast Algorithm for the Euclidean Traveling Salesman Problem, Optimal with Probability One","display_name":"A Fast Algorithm for the Euclidean Traveling Salesman Problem, Optimal with Probability One","publication_year":1982,"publication_date":"1982-02-01","ids":{"openalex":"https://openalex.org/W2055038236","doi":"https://doi.org/10.1137/0211003","mag":"2055038236"},"language":"en","primary_location":{"id":"doi:10.1137/0211003","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0211003","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-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/A5003815243","display_name":"John H. Halton","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"J. H. Halton","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5056885775","display_name":"Routo Terada","orcid":"https://orcid.org/0000-0001-9242-2806"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"R. Terada","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5003815243"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":14.8622,"has_fulltext":false,"cited_by_count":25,"citation_normalized_percentile":{"value":0.98826685,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"11","issue":"1","first_page":"28","last_page":"46"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9975000023841858,"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"}},{"id":"https://openalex.org/T12546","display_name":"Smart Parking Systems Research","score":0.9947999715805054,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.7730109691619873},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.766010046005249},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7022768259048462},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.6327159404754639},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.626729428768158},{"id":"https://openalex.org/keywords/euclidean-space","display_name":"Euclidean space","score":0.5898451209068298},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4676453769207001},{"id":"https://openalex.org/keywords/sigma","display_name":"Sigma","score":0.46204468607902527},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.41791605949401855},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.403409868478775},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4003525376319885},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.10802140831947327},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.06987273693084717}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.7730109691619873},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.766010046005249},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7022768259048462},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.6327159404754639},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.626729428768158},{"id":"https://openalex.org/C186450821","wikidata":"https://www.wikidata.org/wiki/Q17295","display_name":"Euclidean space","level":2,"score":0.5898451209068298},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4676453769207001},{"id":"https://openalex.org/C2778049214","wikidata":"https://www.wikidata.org/wiki/Q7512234","display_name":"Sigma","level":2,"score":0.46204468607902527},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.41791605949401855},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.403409868478775},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4003525376319885},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.10802140831947327},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.06987273693084717},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/0211003","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0211003","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:minds.wisconsin.edu:1793/58242","is_oa":false,"landing_page_url":"http://digital.library.wisc.edu/1793/58242","pdf_url":null,"source":{"id":"https://openalex.org/S4306401622","display_name":"Minds at UW (University of Wisconsin)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I135310074","host_organization_name":"University of Wisconsin\u2013Madison","host_organization_lineage":["https://openalex.org/I135310074"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Technical Report"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W1969186119","https://openalex.org/W1971483538","https://openalex.org/W2014068360","https://openalex.org/W2042986967","https://openalex.org/W2055569927","https://openalex.org/W2143037347"],"related_works":["https://openalex.org/W1525389557","https://openalex.org/W2361554335","https://openalex.org/W2359992618","https://openalex.org/W2164188042","https://openalex.org/W4306878646","https://openalex.org/W2054495636","https://openalex.org/W2075848522","https://openalex.org/W2358341654","https://openalex.org/W3116262722","https://openalex.org/W1992689803"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"an":[3],"algorithm":[4,50,60,77,181],"for":[5,27],"the":[6,49,55,59,79,94,97,102,105,112,119,155,160,163,180,194],"traveling":[7],"salesman":[8],"problem":[9],"in":[10,20,53,82,111,193],"k-dimensional":[11],"Euclidean":[12],"space.":[13],"For":[14],"n":[15,36,41,80,106],"points":[16,81,110],"independently":[17],"uniformly":[18],"distributed":[19],"a":[21,31,83,150],"set":[22,164],"$\\mathbb{E}$,":[23,165],"we":[24,46,87,187],"show":[25,89],"that,":[26,52,90],"any":[28,185],"choice":[29],"of":[30,35,63,68,96,104,162],"function":[32],"$\\sigma":[33],"$":[34,148],"increasing":[37],"to":[38,118,136,139,191],"infinity":[39],"with":[40,91,133],"more":[42],"slowly":[43],"than":[44,66,184],"n,":[45],"can":[47],"adjust":[48],"so":[51],"probability,":[54],"time":[56],"taken":[57],"by":[58],"will":[61,115],"be":[62,116,137],"order":[64,113],"less":[65],"that":[67],"$n\\sigma":[69],"(n)$":[70],"as":[71,123],"$n":[72,124],"\\to":[73,125],"\\infty":[74,126],"$.":[75,127],"The":[76,128],"puts":[78],"cyclic":[84],"order,":[85],"and":[86,169,179],"also":[88],"probability":[92,134],"one,":[93],"length":[95,122],"corresponding":[98],"tour":[99,121],"(that":[100],"is,":[101],"sum":[103],"distances":[107],"between":[108],"adjacent":[109],"given)":[114],"asymptotic":[117,138],"minimal":[120],"latter":[129],"is":[130,149,159,177,182],"known":[131],"(also":[132],"one)":[135],"$\\beta":[140,146],"_k":[141,147],"v(\\mathbb{E})^p":[142],"n^q":[143],"$,":[144],"where":[145],"constant":[151],"depending":[152],"only":[153],"on":[154],"dimension":[156],"k,":[157],"$v(\\mathbb{E})$":[158],"volume":[161],"$p":[166],"=":[167,171],"1/k$,":[168],"$q":[170],"1":[172],"-":[173],"p$.":[174],"Our":[175],"result":[176],"stronger,":[178],"faster,":[183],"other":[186],"have":[188],"been":[189],"able":[190],"find":[192],"literature.":[195]},"counts_by_year":[{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}