{"id":"https://openalex.org/W1971470866","doi":"https://doi.org/10.1002/net.3230220707","title":"Level graphs and approximate shortest path algorithms","display_name":"Level graphs and approximate shortest path algorithms","publication_year":1992,"publication_date":"1992-12-01","ids":{"openalex":"https://openalex.org/W1971470866","doi":"https://doi.org/10.1002/net.3230220707","mag":"1971470866"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230220707","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230220707","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/A5026965380","display_name":"Jacob Shapiro","orcid":null},"institutions":[{"id":"https://openalex.org/I141810926","display_name":"Baruch College","ror":"https://ror.org/023qavy03","country_code":"US","type":"education","lineage":["https://openalex.org/I141810926"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Jacob Shapiro","raw_affiliation_strings":["Baruch College\u2013CUNY, New York, New York, 10010","Baruch College, CUNY, New York, New York 10010"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Baruch College\u2013CUNY, New York, New York, 10010","institution_ids":["https://openalex.org/I141810926"]},{"raw_affiliation_string":"Baruch College, CUNY, New York, New York 10010","institution_ids":["https://openalex.org/I141810926"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5022972238","display_name":"Jerry Waxman","orcid":null},"institutions":[{"id":"https://openalex.org/I111455621","display_name":"Queens College, CUNY","ror":"https://ror.org/03v8adn41","country_code":"US","type":"education","lineage":["https://openalex.org/I111455621"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jerry Waxman","raw_affiliation_strings":["Queens College\u2013CUNY, Flushing, New York, 11367","Queens College, CUNY, Flushing, New York 11367;"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Queens College\u2013CUNY, Flushing, New York, 11367","institution_ids":["https://openalex.org/I111455621"]},{"raw_affiliation_string":"Queens College, CUNY, Flushing, New York 11367;","institution_ids":["https://openalex.org/I111455621"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5016004888","display_name":"Danny Nir","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Danny Nir","raw_affiliation_strings":["SQL Solutions, Burlington, Massachusetts, 01803"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"SQL Solutions, Burlington, Massachusetts, 01803","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5026965380"],"corresponding_institution_ids":["https://openalex.org/I141810926"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":0.5579,"has_fulltext":false,"cited_by_count":39,"citation_normalized_percentile":{"value":0.61631799,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"22","issue":"7","first_page":"691","last_page":"717"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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.9883999824523926,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9860000014305115,"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/shortest-path-problem","display_name":"Shortest path problem","score":0.8352343440055847},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.6725819110870361},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.6684555411338806},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.6647689938545227},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.6602622270584106},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.5706313848495483},{"id":"https://openalex.org/keywords/distance","display_name":"Distance","score":0.5683306455612183},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.535921573638916},{"id":"https://openalex.org/keywords/consistent-heuristic","display_name":"Consistent heuristic","score":0.48455873131752014},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.46128764748573303},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.44328150153160095},{"id":"https://openalex.org/keywords/widest-path-problem","display_name":"Widest path problem","score":0.4401545822620392},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.43092548847198486},{"id":"https://openalex.org/keywords/euclidean-shortest-path","display_name":"Euclidean shortest path","score":0.42042970657348633},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4197382926940918},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.40217357873916626},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2753879129886627},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.18166708946228027},{"id":"https://openalex.org/keywords/incremental-heuristic-search","display_name":"Incremental heuristic search","score":0.15326911211013794},{"id":"https://openalex.org/keywords/beam-search","display_name":"Beam search","score":0.05110365152359009}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.8352343440055847},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.6725819110870361},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.6684555411338806},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.6647689938545227},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.6602622270584106},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.5706313848495483},{"id":"https://openalex.org/C54385418","wikidata":"https://www.wikidata.org/wiki/Q2742711","display_name":"Distance","level":4,"score":0.5683306455612183},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.535921573638916},{"id":"https://openalex.org/C200246849","wikidata":"https://www.wikidata.org/wiki/Q5163226","display_name":"Consistent heuristic","level":5,"score":0.48455873131752014},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.46128764748573303},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.44328150153160095},{"id":"https://openalex.org/C83677490","wikidata":"https://www.wikidata.org/wiki/Q7998708","display_name":"Widest path problem","level":5,"score":0.4401545822620392},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.43092548847198486},{"id":"https://openalex.org/C170836113","wikidata":"https://www.wikidata.org/wiki/Q5406126","display_name":"Euclidean shortest path","level":5,"score":0.42042970657348633},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4197382926940918},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.40217357873916626},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2753879129886627},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.18166708946228027},{"id":"https://openalex.org/C139979381","wikidata":"https://www.wikidata.org/wiki/Q17056021","display_name":"Incremental heuristic search","level":4,"score":0.15326911211013794},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.05110365152359009}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/net.3230220707","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230220707","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1519532587","https://openalex.org/W2057084070","https://openalex.org/W2062266989","https://openalex.org/W2063317962","https://openalex.org/W2084224084","https://openalex.org/W2160365857","https://openalex.org/W2169528473"],"related_works":["https://openalex.org/W2237480599","https://openalex.org/W2018146256","https://openalex.org/W2133099431","https://openalex.org/W2002764510","https://openalex.org/W2375775343","https://openalex.org/W2198982833","https://openalex.org/W2183791707","https://openalex.org/W2186738974","https://openalex.org/W2612665926","https://openalex.org/W4386259575"],"abstract_inverted_index":{"Abstract":[0],"Shortest":[1],"path":[2,60,111,123],"algorithms":[3],"for":[4,80,88],"graphs":[5],"have":[6],"been":[7],"widely":[8],"studied":[9,97],"and":[10,100],"are":[11],"of":[12,19,58,91,109,119],"great":[13],"practical":[14,33],"utility.":[15],"For":[16],"the":[17,45,55,70,107,110,120,125,128],"case":[18],"a":[20,37,75],"general":[21],"graph,":[22,72],"Dijkstra's":[23],"algorithm":[24],"is":[25,36,84,96,104],"known":[26],"to":[27,117],"be":[28,42,63],"optimal.":[29],"However,":[30],"in":[31],"many":[32],"instances,":[34],"there":[35],"\u201clevel\u201d":[38],"structure":[39,83],"which":[40,86],"may":[41,62],"imposed":[43],"on":[44],"underlying":[46],"graph.":[47],"Utilizing":[48],"these":[49],"levels,":[50],"this":[51],"paper":[52],"demonstrates":[53],"that":[54,82,106,118],"time":[56],"complexity":[57],"shortest":[59,93,122],"generation":[61,90],"greatly":[64],"reduced.":[65],"A":[66],"new":[67],"graph":[68],"structure,":[69],"level":[71],"together":[73],"with":[74],"simple":[76],"uniformed":[77],"heuristic,":[78],"LGS,":[79],"searching":[81],"introduced,":[85],"allows":[87],"rapid":[89],"approximate":[92],"paths.":[94],"LGS":[95,114],"both":[98],"analytically":[99],"via":[101],"simulation.":[102],"It":[103],"shown":[105],"length":[108],"produced":[112],"by":[113],"converges":[115],"rapidly":[116],"actual":[121],"as":[124],"distance":[126],"between":[127],"points":[129],"increases.":[130]},"counts_by_year":[{"year":2022,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-05-21T09:19:25.381259","created_date":"2025-10-10T00:00:00"}