{"id":"https://openalex.org/W1992876208","doi":"https://doi.org/10.1016/0304-3975(91)90263-2","title":"Shortest paths without a map","display_name":"Shortest paths without a map","publication_year":1991,"publication_date":"1991-07-01","ids":{"openalex":"https://openalex.org/W1992876208","doi":"https://doi.org/10.1016/0304-3975(91)90263-2","mag":"1992876208"},"language":"en","primary_location":{"id":"doi:10.1016/0304-3975(91)90263-2","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0304-3975(91)90263-2","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","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/A5104056982","display_name":"Christos H. Papadimitriou","orcid":"https://orcid.org/0009-0004-6462-2316"},"institutions":[{"id":"https://openalex.org/I36258959","display_name":"University of California San Diego","ror":"https://ror.org/0168r3w48","country_code":"US","type":"education","lineage":["https://openalex.org/I36258959"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Christos H. Papadimitriou","raw_affiliation_strings":["Department of Computer Science and Engineering, University of California, San Diego, USA","Department of Computer Science and Engineering,  University of California at San Diego, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, University of California, San Diego, USA","institution_ids":["https://openalex.org/I36258959"]},{"raw_affiliation_string":"Department of Computer Science and Engineering,  University of California at San Diego, USA","institution_ids":["https://openalex.org/I36258959"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5043084405","display_name":"Mihalis Yannakakis","orcid":"https://orcid.org/0000-0003-2857-1860"},"institutions":[{"id":"https://openalex.org/I1283103587","display_name":"AT&T (United States)","ror":"https://ror.org/02bbd5539","country_code":"US","type":"company","lineage":["https://openalex.org/I1283103587"]},{"id":"https://openalex.org/I72090969","display_name":"Nokia (United States)","ror":"https://ror.org/038km2573","country_code":"US","type":"company","lineage":["https://openalex.org/I2738502077","https://openalex.org/I72090969"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mihalis Yannakakis","raw_affiliation_strings":["AT&T Bell Laboratories USA","AT&T Bell Laboratories , USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"AT&T Bell Laboratories USA","institution_ids":["https://openalex.org/I1283103587"]},{"raw_affiliation_string":"AT&T Bell Laboratories , USA","institution_ids":["https://openalex.org/I72090969"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2600,"currency":"USD","value_usd":2600},"apc_paid":null,"fwci":8.7313,"has_fulltext":false,"cited_by_count":409,"citation_normalized_percentile":{"value":0.9758484,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":98,"max":100},"biblio":{"volume":"84","issue":"1","first_page":"127","last_page":"150"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9998999834060669,"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.9998999834060669,"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/T11182","display_name":"Auction Theory and Applications","score":0.9909999966621399,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9854000210762024,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/heuristics","display_name":"Heuristics","score":0.6715337038040161},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6178434491157532},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5411521792411804},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5392832159996033},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5252910852432251},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.4815266728401184},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.4789441227912903},{"id":"https://openalex.org/keywords/unit-square","display_name":"Unit square","score":0.4660668671131134},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.462797611951828},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.44582709670066833},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.41747811436653137},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36550313234329224},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.35624760389328003},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.15878689289093018}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6715337038040161},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6178434491157532},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5411521792411804},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5392832159996033},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5252910852432251},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.4815266728401184},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.4789441227912903},{"id":"https://openalex.org/C7356347","wikidata":"https://www.wikidata.org/wiki/Q1307838","display_name":"Unit square","level":2,"score":0.4660668671131134},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.462797611951828},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.44582709670066833},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.41747811436653137},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36550313234329224},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.35624760389328003},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.15878689289093018},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/0304-3975(91)90263-2","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0304-3975(91)90263-2","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.7699999809265137}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1497277914","https://openalex.org/W2011039300","https://openalex.org/W2019851160","https://openalex.org/W2024693023","https://openalex.org/W2041645394","https://openalex.org/W2053913299","https://openalex.org/W2082859480","https://openalex.org/W2108567935","https://openalex.org/W2125690626","https://openalex.org/W2137909125","https://openalex.org/W2144050074","https://openalex.org/W2170220350","https://openalex.org/W2307250208","https://openalex.org/W4285719527","https://openalex.org/W6629798423","https://openalex.org/W6671049055","https://openalex.org/W6684846674","https://openalex.org/W6698365562"],"related_works":["https://openalex.org/W4382866750","https://openalex.org/W4293167680","https://openalex.org/W2776102956","https://openalex.org/W4387185483","https://openalex.org/W616034966","https://openalex.org/W2022506245","https://openalex.org/W2040572217","https://openalex.org/W2388410942","https://openalex.org/W4385965963","https://openalex.org/W2600678155"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":8},{"year":2025,"cited_by_count":7},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":9},{"year":2022,"cited_by_count":11},{"year":2021,"cited_by_count":14},{"year":2020,"cited_by_count":12},{"year":2019,"cited_by_count":14},{"year":2018,"cited_by_count":14},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":13},{"year":2015,"cited_by_count":16},{"year":2014,"cited_by_count":16},{"year":2013,"cited_by_count":17},{"year":2012,"cited_by_count":12}],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2025-10-10T00:00:00"}