{"id":"https://openalex.org/W292099356","doi":null,"title":"Finding the k Shortest Simple Paths: A New Algorithm and Its Implementation.","display_name":"Finding the k Shortest Simple Paths: A New Algorithm and Its Implementation.","alternate_titles":[],"publication_year":2003,"publication_date":"2003-01-01","ids":{"openalex":"https://openalex.org/W292099356","mag":"292099356"},"language":"en","primary_location":{"id":"mag:292099356","doi":null,"is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/conf/alenex/alenex2003.html#HershbergerMS03","pdf_url":null,"source":{"id":"https://openalex.org/S4306417648","display_name":"Algorithm Engineering and Experimentation","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Algorithm Engineering and Experimentation","raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W292099356"],"child_works_count":0,"type":"conference-paper","is_traditional":true,"indexed_in":[],"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/A5038416046","display_name":"John E. Hershberger","orcid":"https://orcid.org/0009-0004-6307-4194","observed_orcids":["https://orcid.org/0009-0004-6307-4194"]},"institutions":[{"id":"https://openalex.org/I4387155334","display_name":"Mentor Graphics (United States)","ror":"https://ror.org/00r59k631","country_code":"US","type":"company","lineage":["https://openalex.org/I1325886976","https://openalex.org/I4210137693","https://openalex.org/I4387155334"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"John Hershberger","raw_affiliation_strings":["Mentor Graphics Corporation (Wilsonville, OR)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Mentor Graphics Corporation (Wilsonville, OR)","institution_ids":["https://openalex.org/I4387155334"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5043435131","display_name":"Matthew Maxel","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I154570441","display_name":"University of California, Santa Barbara","ror":"https://ror.org/02t274463","country_code":"US","type":"education","lineage":["https://openalex.org/I154570441"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Matthew Maxel","raw_affiliation_strings":["University of California at Santa Barbara, Santa Barbara, CA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California at Santa Barbara, Santa Barbara, CA#TAB#","institution_ids":["https://openalex.org/I154570441"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072397842","display_name":"Subhash Suri","orcid":"https://orcid.org/0000-0002-5668-7521","observed_orcids":["https://orcid.org/0000-0002-5668-7521"]},"institutions":[{"id":"https://openalex.org/I154570441","display_name":"University of California, Santa Barbara","ror":"https://ror.org/02t274463","country_code":"US","type":"education","lineage":["https://openalex.org/I154570441"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Subhash Suri","raw_affiliation_strings":["University of California at Santa Barbara, Santa Barbara, CA#TAB#"],"raw_orcid":"https://orcid.org/0000-0002-5668-7521","affiliations":[{"raw_affiliation_string":"University of California at Santa Barbara, Santa Barbara, CA#TAB#","institution_ids":["https://openalex.org/I154570441"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.2655,"has_fulltext":false,"cited_by_count":73,"citation_normalized_percentile":{"value":0.92441287,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":86,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"26","last_page":"36"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9916999936103821,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9916999936103821,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.007799999788403511,"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/T11269","display_name":"Algorithms and Data Compression","score":9.999999747378752e-05,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/replacement-paths","display_name":"replacement paths","score":0.824999988079071},{"id":"https://openalex.org/keywords/directed-graphs","display_name":"directed graphs","score":0.800000011920929},{"id":"https://openalex.org/keywords/fault-detection","display_name":"fault detection","score":0.7179999947547913},{"id":"https://openalex.org/keywords/wireless-ad-hoc-networks","display_name":"wireless ad hoc networks","score":0.9210000038146973},{"id":"https://openalex.org/keywords/shortest-path-algorithms","display_name":"shortest path algorithms","score":0.5889999866485596}],"concepts":[{"id":"https://openalex.org/C96147967","wikidata":"https://www.wikidata.org/wiki/Q190686","display_name":"Subroutine","level":2,"score":0.7914752960205078},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7493751645088196},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.7335605621337891},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4952169954776764},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.48847854137420654},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.4678386449813843},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.43112289905548096},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.40784990787506104},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.27723750472068787},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2445659339427948},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"mag:292099356","doi":null,"is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/conf/alenex/alenex2003.html#HershbergerMS03","pdf_url":null,"source":{"id":"https://openalex.org/S4306417648","display_name":"Algorithm Engineering and Experimentation","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Algorithm Engineering and Experimentation","raw_type":null},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.15.3724","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.15.3724","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.ucsb.edu/~suri/psdir/alenex.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W1970543907","https://openalex.org/W796163220","https://openalex.org/W4287245127","https://openalex.org/W7099118493","https://openalex.org/W2962770773","https://openalex.org/W6943961734","https://openalex.org/W1969097955","https://openalex.org/W4388415679","https://openalex.org/W2808332191","https://openalex.org/W2107335359"],"abstract_inverted_index":{"We":[0],"describe":[1],"a":[2,14,27,41,51,87,93,121],"new":[3,126],"algorithm":[4,23,30,78,91,99,127,155,169],"to":[5,60,86],"enumerate":[6],"the":[7,53,67,81,98,107,116,125,129,133],"k":[8,75],"shortest":[9,76],"simple":[10],"(loopless)":[11],"paths":[12,29,56,77,118],"in":[13,138],"directed":[15,64],"graph":[16],"and":[17,35,38,72,124,151],"report":[18],"on":[19,26,143],"its":[20,101],"implementation.":[21],"Our":[22,111],"is":[24,50,58,69,95,109,120,156,170],"based":[25],"replacement":[28,55,117],"proposed":[31],"recently":[32],"by":[33],"Hershberger":[34],"Suri":[36],"[7],":[37],"can":[39,135],"yield":[40],"factor":[42],"#(n)":[43,102],"improvement":[44,134],"for":[45,62],"this":[46],"problem.":[47],"But":[48],"there":[49],"caveat:":[52],"fast":[54,82],"subroutine":[57],"known":[59],"fail":[61],"some":[63],"graphs.":[65,140],"However,":[66],"failure":[68,94,119],"easily":[70],"detected,":[71],"so":[73],"our":[74,154,168],"optimistically":[79],"uses":[80],"subroutine,":[83],"then":[84],"switches":[85],"slower":[88],"but":[89],"correct":[90],"if":[92],"detected.":[96],"Thus":[97],"achieves":[100],"speed":[103],"advantage":[104],"only":[105],"when":[106],"optimism":[108],"justified.":[110],"empirical":[112],"results":[113],"show":[114],"that":[115],"rare":[122],"phenomenon,":[123],"outperforms":[128],"current":[130],"best":[131],"algorithms;":[132],"be":[136],"substantial":[137],"large":[139],"For":[141],"instance,":[142],"GIS":[144],"map":[145],"data":[146],"with":[147],"about":[148,171],"5000":[149],"nodes":[150],"12000":[152],"edges,":[153],"4-8":[157],"times":[158,173],"faster.":[159,174],"In":[160],"synthetic":[161],"graphs":[162],"modeling":[163],"wireless":[164],"ad":[165],"hoc":[166],"networks,":[167],"20":[172]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W292099356","counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":3},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":8},{"year":2012,"cited_by_count":1}],"updated_date":"2026-11-17T12:49:18.490984","created_date":"2016-06-24T00:00:00"}
