{"id":"https://openalex.org/W1542490308","doi":"https://doi.org/10.1137/s0097539792235384","title":"When Is the Assignment Bound Tight for the Asymmetric Traveling-Salesman Problem?","display_name":"When Is the Assignment Bound Tight for the Asymmetric Traveling-Salesman Problem?","publication_year":1995,"publication_date":"1995-06-01","ids":{"openalex":"https://openalex.org/W1542490308","doi":"https://doi.org/10.1137/s0097539792235384","mag":"1542490308"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539792235384","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539792235384","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":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Alan Frieze","raw_affiliation_strings":["Carnegie Mellon University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5068875104","display_name":"Richard M. Karp","orcid":null},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Richard M. Karp","raw_affiliation_strings":["Carnegie Mellon University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5104507387","display_name":"Bruce A. Reed","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Bruce Reed","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5056950019"],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.0568012,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"24","issue":"3","first_page":"484","last_page":"493"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11716","display_name":"Random Matrices and Applications","score":0.9973000288009644,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11716","display_name":"Random Matrices and Applications","score":0.9973000288009644,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.987500011920929,"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/T10974","display_name":"Advanced Queuing Theory Analysis","score":0.9794999957084656,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.8432193994522095},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7976369857788086},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5732465982437134},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5370560884475708},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.43592238426208496},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.4152209162712097},{"id":"https://openalex.org/keywords/expected-value","display_name":"Expected value","score":0.41505467891693115},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.4145541787147522},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.39720386266708374},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.19342011213302612},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.17602470517158508},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.15817764401435852},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.08044523000717163},{"id":"https://openalex.org/keywords/biology","display_name":"Biology","score":0.06308689713478088}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8432193994522095},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7976369857788086},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5732465982437134},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5370560884475708},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.43592238426208496},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.4152209162712097},{"id":"https://openalex.org/C141042865","wikidata":"https://www.wikidata.org/wiki/Q200125","display_name":"Expected value","level":2,"score":0.41505467891693115},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.4145541787147522},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39720386266708374},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.19342011213302612},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.17602470517158508},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.15817764401435852},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.08044523000717163},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.06308689713478088},{"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/C169760540","wikidata":"https://www.wikidata.org/wiki/Q207011","display_name":"Neuroscience","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1137/s0097539792235384","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539792235384","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:hdl:10068/215052","is_oa":false,"landing_page_url":"http://hdl.handle.net/10068/215052","pdf_url":null,"source":{"id":"https://openalex.org/S4377196900","display_name":"OpenGrey (Institut de l'Information Scientifique et Technique)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1295345811","host_organization_name":"Institut de l'Information Scientifique et Technique","host_organization_lineage":["https://openalex.org/I1295345811"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"I - Miscellaneous"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.38.2328","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.38.2328","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.icsi.berkeley.edu/pub/techreports/1992/tr-92-074.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.50.1803","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.50.1803","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.cmu.edu/~af1p/tsp.ps.gz","raw_type":"text"},{"id":"mag:1542490308","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/conf/ipco/ipco1992.html#FriezeKR92","pdf_url":null,"source":{"id":"https://openalex.org/S4306418923","display_name":"Integer Programming and Combinatorial Optimization","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Integer Programming and Combinatorial Optimization","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1073380713","display_name":"Algorithms and Complexity with Concentration on             Probabilistic Analysis","funder_award_id":"9024935","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8842297662","display_name":"A Proposal for Research on Randomized Algorithms and        Probablistic Analysis of Algorithms","funder_award_id":"9017380","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W1974769464","https://openalex.org/W1981700549","https://openalex.org/W2000334112","https://openalex.org/W2003351966","https://openalex.org/W2019496833","https://openalex.org/W2062749672"],"related_works":["https://openalex.org/W330417094","https://openalex.org/W2570390297","https://openalex.org/W312324576","https://openalex.org/W2952307158","https://openalex.org/W2559068105","https://openalex.org/W2950391451","https://openalex.org/W2399828101","https://openalex.org/W1492330513","https://openalex.org/W3167829930","https://openalex.org/W2606479096","https://openalex.org/W2045615124","https://openalex.org/W3036605877","https://openalex.org/W2805270032","https://openalex.org/W2774298280","https://openalex.org/W2293160748","https://openalex.org/W2951393205","https://openalex.org/W3185856802","https://openalex.org/W2588896144","https://openalex.org/W3023424394","https://openalex.org/W2337467223"],"abstract_inverted_index":{"We":[0,24,46],"consider":[1],"the":[2,6,17,28,49,56,90],"probabilistic":[3],"relationship":[4,50],"between":[5,51],"value":[7,18],"of":[8,19],"a":[9],"random":[10],"asymmetric":[11],"traveling":[12],"salesman":[13],"problem":[14],"$\\textit{ATSP}(M)$":[15],"and":[16,43,55,101],"its":[20],"assignment":[21],"relaxation":[22],"$\\textit{AP}(M)$.":[23],"assume":[25],"here":[26],"that":[27,59,75,92],"costs":[29],"are":[30,41],"given":[31],"by":[32],"an":[33],"$n":[34],"\\times":[35],"n$":[36],"matrix":[37],"M":[38],"whose":[39],"entries":[40],"independently":[42],"identically":[44],"distributed.":[45],"focus":[47],"on":[48],"$Pr(\\textit{ATSP}(M)":[52,104,123],"=":[53,77,105,124],"\\textit{AP}(M))$":[54],"probability":[57,80],"$p_{n}$":[58],"any":[60],"particular":[61],"entry":[62],"is":[63,83],"zero.":[64],"If":[65],"$np_{n}":[66,119],"\\rightarrow":[67,96,120,126],"\\infty":[68],"$":[69],"with":[70,79],"n":[71],"then":[72,103,122],"we":[73],"prove":[74],"$\\textit{ATSP}(M)":[76],"\\textit{AP}(M)$":[78],"1-o(1).":[81],"This":[82],"shown":[84],"to":[85],"be":[86],"best":[87],"possible":[88],"in":[89],"sense":[91],"if":[93,118],"$np":[94],"(n)":[95],"c,\\,":[97],"c":[98],">":[99],"0$":[100,121],"constant,":[102],"\\textit{AP}(M))":[106,125],"<":[107],"1":[108],"-":[109],"\\phi":[110],"(c)$":[111],"for":[112],"some":[113],"positive":[114],"function":[115],"$\\phi$.":[116],"Finally,":[117],"0$.":[127]},"counts_by_year":[{"year":2014,"cited_by_count":1}],"updated_date":"2026-04-28T14:05:53.105641","created_date":"2025-10-10T00:00:00"}