{"id":"https://openalex.org/W2035337703","doi":"https://doi.org/10.1137/s0097539701391518","title":"The Probabilistic Relationship Between the Assignment and Asymmetric Traveling Salesman Problems","display_name":"The Probabilistic Relationship Between the Assignment and Asymmetric Traveling Salesman Problems","publication_year":2007,"publication_date":"2007-01-01","ids":{"openalex":"https://openalex.org/W2035337703","doi":"https://doi.org/10.1137/s0097539701391518","mag":"2035337703"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539701391518","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539701391518","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/A5056950019","display_name":"Alan Frieze","orcid":"https://orcid.org/0000-0002-8481-5615"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Alan Frieze","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5083890565","display_name":"Gregory B. Sorkin","orcid":"https://orcid.org/0000-0003-4935-7820"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Gregory B. Sorkin","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5056950019"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3209,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.6387444,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"36","issue":"5","first_page":"1435","last_page":"1452"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9995999932289124,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9995999932289124,"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/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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.870065450668335},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7879751324653625},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.6774882078170776},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6591836214065552},{"id":"https://openalex.org/keywords/complete-bipartite-graph","display_name":"Complete bipartite graph","score":0.5698344111442566},{"id":"https://openalex.org/keywords/omega","display_name":"Omega","score":0.5649232864379883},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.49487584829330444},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4931890368461609},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4690908193588257},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4639667272567749},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.4371151924133301},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.43142417073249817},{"id":"https://openalex.org/keywords/tilde","display_name":"Tilde","score":0.42876917123794556},{"id":"https://openalex.org/keywords/assignment-problem","display_name":"Assignment problem","score":0.42611822485923767},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2700498700141907},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1677456498146057},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.06919735670089722},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.06549674272537231},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.0637153685092926}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.870065450668335},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7879751324653625},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.6774882078170776},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6591836214065552},{"id":"https://openalex.org/C134119311","wikidata":"https://www.wikidata.org/wiki/Q913598","display_name":"Complete bipartite graph","level":4,"score":0.5698344111442566},{"id":"https://openalex.org/C2779557605","wikidata":"https://www.wikidata.org/wiki/Q9890","display_name":"Omega","level":2,"score":0.5649232864379883},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.49487584829330444},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4931890368461609},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4690908193588257},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4639667272567749},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.4371151924133301},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.43142417073249817},{"id":"https://openalex.org/C36686422","wikidata":"https://www.wikidata.org/wiki/Q11167","display_name":"Tilde","level":2,"score":0.42876917123794556},{"id":"https://openalex.org/C85044808","wikidata":"https://www.wikidata.org/wiki/Q620614","display_name":"Assignment problem","level":2,"score":0.42611822485923767},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2700498700141907},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1677456498146057},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.06919735670089722},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.06549674272537231},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0637153685092926},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s0097539701391518","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539701391518","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"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4300000071525574,"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1969186119","https://openalex.org/W1972196995","https://openalex.org/W1973286131","https://openalex.org/W1975992139","https://openalex.org/W1980848544","https://openalex.org/W1995289318","https://openalex.org/W2000334112","https://openalex.org/W2059014957","https://openalex.org/W2062749672","https://openalex.org/W2089514086","https://openalex.org/W2095403663"],"related_works":["https://openalex.org/W4376138746","https://openalex.org/W4389782626","https://openalex.org/W2361554335","https://openalex.org/W2171568915","https://openalex.org/W1595757466","https://openalex.org/W2359992618","https://openalex.org/W4200179302","https://openalex.org/W4309336419","https://openalex.org/W2946024655","https://openalex.org/W2620231896"],"abstract_inverted_index":{"We":[0],"consider":[1,115],"the":[2,5,21,35,50,63,70,87,110,116,120],"gap":[3,51,90,118],"between":[4,119],"cost":[6,22],"of":[7,23,62,65,86],"an":[8,24,40,75,92],"optimal":[9,25,76,121],"assignment":[10,77],"in":[11,29,74],"a":[12,30,101],"complete":[13,31],"bipartite":[14],"graph":[15,33],"with":[16,34,47,96],"random":[17,102],"edge":[18,37,72],"weights,":[19],"and":[20,55,122,130],"traveling":[26,104],"salesman":[27,105],"tour":[28],"directed":[32],"same":[36],"weights.":[38],"Using":[39],"improved":[41],"\u201cpatching\u201d":[42],"heuristic,":[43],"we":[44,113],"show":[45],"that":[46,56,69],"high":[48,97],"probability":[49],"is":[52,59,68,91,126],"$O((\\ln":[53],"n)^2/n)$,":[54],"its":[57],"expectation":[58,79],"$\\Omega(1/n)$.":[60],"One":[61],"underpinnings":[64],"this":[66],"result":[67],"largest":[71],"weight":[73],"has":[78],"$\\Theta(\\ln":[80],"n":[81],"/":[82],"n)$.":[83],"A":[84],"consequence":[85],"small":[88],"assignment\u2013TSP":[89,111],"$e^{\\tilde{O}(\\sqrt{n})}$\u2010time":[93],"algorithm":[94],"which,":[95],"probability,":[98],"exactly":[99],"solves":[100],"asymmetric":[103],"instance.":[106],"In":[107],"addition":[108],"to":[109],"gap,":[112],"also":[114],"expected":[117],"second\u2010best":[123],"assignments;":[124],"it":[125],"at":[127,131],"least":[128],"$\\Omega(1/n^2)$":[129],"most":[132],"$O(\\ln":[133],"n/n^2)$.":[134]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}