{"id":"https://openalex.org/W2049176474","doi":"https://doi.org/10.1002/net.3230180103","title":"Probabilistic analysis of the longest hamiltonian tour problem","display_name":"Probabilistic analysis of the longest hamiltonian tour problem","publication_year":1988,"publication_date":"1988-03-01","ids":{"openalex":"https://openalex.org/W2049176474","doi":"https://doi.org/10.1002/net.3230180103","mag":"2049176474"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230180103","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230180103","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","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/A5010335625","display_name":"Rakesh Vohra","orcid":"https://orcid.org/0000-0003-1049-0827"},"institutions":[{"id":"https://openalex.org/I52357470","display_name":"The Ohio State University","ror":"https://ror.org/00rs6vg23","country_code":"US","type":"education","lineage":["https://openalex.org/I52357470"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Rakesh V. Vohra","raw_affiliation_strings":["Faculty of Management Sciences, Ohio State University, Columbus, Ohio 43210-1399","Faculty of Management Sciences, Ohio State University, Columbus, Ohio 43210\u20101399"],"affiliations":[{"raw_affiliation_string":"Faculty of Management Sciences, Ohio State University, Columbus, Ohio 43210-1399","institution_ids":["https://openalex.org/I52357470"]},{"raw_affiliation_string":"Faculty of Management Sciences, Ohio State University, Columbus, Ohio 43210\u20101399","institution_ids":["https://openalex.org/I52357470"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5010335625"],"corresponding_institution_ids":["https://openalex.org/I52357470"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.18306189,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"18","issue":"1","first_page":"13","last_page":"18"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9952999949455261,"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.9952999949455261,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9951000213623047,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9950000047683716,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.7421529293060303},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.739788293838501},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6338678598403931},{"id":"https://openalex.org/keywords/hamiltonian","display_name":"Hamiltonian (control theory)","score":0.6176421642303467},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5449929237365723},{"id":"https://openalex.org/keywords/probabilistic-analysis-of-algorithms","display_name":"Probabilistic analysis of algorithms","score":0.5128920078277588},{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.47797366976737976},{"id":"https://openalex.org/keywords/random-graph","display_name":"Random graph","score":0.4776533842086792},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.47345370054244995},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.4281187653541565},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.42063865065574646},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.41304266452789307},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3367413878440857},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3282690644264221},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.1560482382774353},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.14854586124420166}],"concepts":[{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.7421529293060303},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.739788293838501},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6338678598403931},{"id":"https://openalex.org/C130787639","wikidata":"https://www.wikidata.org/wiki/Q5645293","display_name":"Hamiltonian (control theory)","level":2,"score":0.6176421642303467},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5449929237365723},{"id":"https://openalex.org/C24404364","wikidata":"https://www.wikidata.org/wiki/Q7246846","display_name":"Probabilistic analysis of algorithms","level":3,"score":0.5128920078277588},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.47797366976737976},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.4776533842086792},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.47345370054244995},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.4281187653541565},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42063865065574646},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.41304266452789307},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3367413878440857},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3282690644264221},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.1560482382774353},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.14854586124420166}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/net.3230180103","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230180103","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1965258184","https://openalex.org/W1998167497","https://openalex.org/W1999245030","https://openalex.org/W2025533349","https://openalex.org/W2054630393","https://openalex.org/W2119606130","https://openalex.org/W2144242878","https://openalex.org/W2172285784","https://openalex.org/W4302805316"],"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/W4241541331","https://openalex.org/W2259723333","https://openalex.org/W1002323541","https://openalex.org/W2159144508","https://openalex.org/W1557925886"],"abstract_inverted_index":{"Abstract":[0],"In":[1],"this":[2],"paper":[3],"we":[4],"study":[5],"the":[6,10,16,25,39,42,47],"probabilistic":[7],"behavior":[8],"of":[9,41],"farthest":[11],"neighbor":[12],"heuristic":[13,43],"for":[14],"finding":[15],"longest":[17],"Hamiltonian":[18],"tour":[19,44,49],"in":[20,34],"a":[21],"graph.":[22],"We":[23,62],"assume":[24],"edge":[26],"weights":[27],"are":[28],"independent":[29],"random":[30],"variables":[31],"uniformly":[32],"distributed":[33],"[0,1].":[35],"If":[36],"F,":[37],"is":[38],"length":[40],"and":[45],"L,":[46],"optimal":[48],"then":[50],"F":[51],"n":[52,54,59,67,73],"/L":[53],"\u2192":[55,60,69,74],"1":[56,70],"a.s.":[57,71],"as":[58,72],"\u03b1.":[61],"also":[63],"show":[64],"that":[65],"L":[66],"/n":[68],"\u221e.":[75]},"counts_by_year":[{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}