{"id":"https://openalex.org/W2063112592","doi":"https://doi.org/10.1137/0216068","title":"On the Exact Solution of Random Travelling Salesman Problems with Medium Size Integer Coefficients","display_name":"On the Exact Solution of Random Travelling Salesman Problems with Medium Size Integer Coefficients","publication_year":1987,"publication_date":"1987-12-01","ids":{"openalex":"https://openalex.org/W2063112592","doi":"https://doi.org/10.1137/0216068","mag":"2063112592"},"language":"en","primary_location":{"id":"doi:10.1137/0216068","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0216068","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":"A. M. Frieze","raw_affiliation_strings":["Carnegie-Mellon, Pittsburgh, Pittsburgh, PA#TAB#"],"affiliations":[{"raw_affiliation_string":"Carnegie-Mellon, Pittsburgh, Pittsburgh, PA#TAB#","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5056950019"],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":null,"apc_paid":null,"fwci":3.3587,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.91982942,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":null,"biblio":{"volume":"16","issue":"6","first_page":"1052","last_page":"1072"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9998000264167786,"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.9998000264167786,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9968000054359436,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9941999912261963,"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.8307691812515259},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8058946132659912},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7093548774719238},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6172278523445129},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.5330145955085754},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.5143576860427856},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5095434784889221},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.45214375853538513},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.44822579622268677},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.15297165513038635},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.10540837049484253}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8307691812515259},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8058946132659912},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7093548774719238},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6172278523445129},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5330145955085754},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.5143576860427856},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5095434784889221},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.45214375853538513},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44822579622268677},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.15297165513038635},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.10540837049484253},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0216068","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0216068","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":[{"display_name":"Decent work and economic growth","score":0.47999998927116394,"id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1976286395","https://openalex.org/W2009232680","https://openalex.org/W2012473793","https://openalex.org/W2017777628","https://openalex.org/W2055038236","https://openalex.org/W2061496873","https://openalex.org/W2062749672","https://openalex.org/W2071896207","https://openalex.org/W2078550108","https://openalex.org/W2130956934","https://openalex.org/W2139935705","https://openalex.org/W2143037347","https://openalex.org/W2579120225","https://openalex.org/W4312512934"],"related_works":["https://openalex.org/W4376138746","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/W2620231896","https://openalex.org/W2946024655","https://openalex.org/W2265604726"],"abstract_inverted_index":{"Let":[0],"edge":[1],"weights":[2],"for":[3],"the":[4,50],"complete":[5],"graph":[6],"on":[7],"vertex":[8],"set":[9],"$\\{":[10,21],"1,2,":[11],"\\cdots":[12,23],",n\\}":[13],"$":[14,27],"be":[15],"chosen":[16],"independently":[17],"and":[18],"uniformly":[19],"from":[20],"0,1,":[22],",B(n)":[24],"-":[25],"1\\}":[26],"where":[28],"$B(n)":[29],"=":[30],"o({n":[31],"/":[32],"{\\log":[33],"\\log":[34,45],"n}})$.":[35],"We":[36],"show":[37],"that":[38],"there":[39],"exists":[40],"a":[41],"polynomial":[42],"time":[43],"$(O(n^3":[44],"n))$":[46],"algorithm":[47],"which":[48],"solves":[49],"associated":[51],"travelling":[52],"salesman":[53],"problem":[54],"with":[55],"probability":[56],"tending":[57],"to":[58,63],"1":[59],"as":[60],"n":[61],"tends":[62],"$\\infty":[64],"$.":[65]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}