{"id":"https://openalex.org/W2114222911","doi":"https://doi.org/10.1109/sfcs.2002.1182004","title":"On random symmetric travelling salesman problems","display_name":"On random symmetric travelling salesman problems","publication_year":2003,"publication_date":"2003-06-26","ids":{"openalex":"https://openalex.org/W2114222911","doi":"https://doi.org/10.1109/sfcs.2002.1182004","mag":"2114222911"},"language":"en","primary_location":{"id":"doi:10.1109/sfcs.2002.1182004","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sfcs.2002.1182004","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings.","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/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. Frieze","raw_affiliation_strings":["Department of Mathematical Sciences, Carnegie Mellon University, USA","Dept. of Math. Sci., Carnegie Mellon Univ., Pittsburgh, PA, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Mathematical Sciences, Carnegie Mellon University, USA","institution_ids":["https://openalex.org/I74973139"]},{"raw_affiliation_string":"Dept. of Math. Sci., Carnegie Mellon Univ., Pittsburgh, PA, USA#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":1.0635,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.77881812,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"16","issue":null,"first_page":"789","last_page":"798"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9987000226974487,"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"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9987000226974487,"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/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9976000189781189,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9966999888420105,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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.9102966785430908},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7831826210021973},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5842106938362122},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.5080351829528809},{"id":"https://openalex.org/keywords/minimum-weight","display_name":"Minimum weight","score":0.48881885409355164},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.481469064950943},{"id":"https://openalex.org/keywords/graph-theory","display_name":"Graph theory","score":0.4383552372455597},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.43502095341682434},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.23063957691192627},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.22131404280662537},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.07160595059394836}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.9102966785430908},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7831826210021973},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5842106938362122},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.5080351829528809},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.48881885409355164},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.481469064950943},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.4383552372455597},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43502095341682434},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.23063957691192627},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.22131404280662537},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.07160595059394836}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/sfcs.2002.1182004","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sfcs.2002.1182004","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings.","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":12,"referenced_works":["https://openalex.org/W174303507","https://openalex.org/W1504317671","https://openalex.org/W1577466578","https://openalex.org/W2000334112","https://openalex.org/W2003351966","https://openalex.org/W2028094090","https://openalex.org/W2035337703","https://openalex.org/W2054812794","https://openalex.org/W2059014957","https://openalex.org/W2061496873","https://openalex.org/W2062749672","https://openalex.org/W2144931885"],"related_works":["https://openalex.org/W1525389557","https://openalex.org/W2361554335","https://openalex.org/W2164188042","https://openalex.org/W2359992618","https://openalex.org/W2054495636","https://openalex.org/W4306878646","https://openalex.org/W3005108979","https://openalex.org/W2913191894","https://openalex.org/W3157689847","https://openalex.org/W4389782626"],"abstract_inverted_index":{"Let":[0,17],"the":[1,4,24,27,50],"edges":[2],"of":[3,26,52],"complete":[5],"graph":[6],"K/sub":[7],"n/":[8],"be":[9,23],"assigned":[10],"independent":[11],"uniform":[12],"[0,1]":[13],"random":[14],"edge":[15],"weights.":[16],"Z/sub":[18,21,66],"TSP/":[19],"and":[20,33],"2FAC/":[22],"weights":[25],"minimum":[28,34],"length":[29],"travelling":[30],"salesman":[31],"tour":[32,60],"weight":[35],"2-factor":[36],"respectively.":[37],"We":[38],"show":[39],"that":[40,57],"whp/sup":[41],"1/":[42],"|Z/sub":[43],"TSP/-Z/sub":[44],"2FAC/|=(1).":[45],"The":[46],"proof":[47],"is":[48],"via":[49],"analysis":[51],"a":[53,59,62],"polynomial":[54],"time":[55],"algorithm":[56],"finds":[58],"only":[61],"little":[63],"longer":[64],"than":[65],"2FAC/.":[67]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}