{"id":"https://openalex.org/W2109998612","doi":"https://doi.org/10.1002/spe.4380240904","title":"Optimized<i>k</i>\u2010shortest\u2010paths algorithm for facility restoration","display_name":"Optimized<i>k</i>\u2010shortest\u2010paths algorithm for facility restoration","publication_year":1994,"publication_date":"1994-09-01","ids":{"openalex":"https://openalex.org/W2109998612","doi":"https://doi.org/10.1002/spe.4380240904","mag":"2109998612"},"language":"en","primary_location":{"id":"doi:10.1002/spe.4380240904","is_oa":false,"landing_page_url":"https://doi.org/10.1002/spe.4380240904","pdf_url":null,"source":{"id":"https://openalex.org/S122199241","display_name":"Software Practice and Experience","issn_l":"0038-0644","issn":["0038-0644","1097-024X"],"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":"Software: Practice and Experience","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/A5029371742","display_name":"M.H. MacGregor","orcid":"https://orcid.org/0000-0002-2381-1290"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"M. H. Macgregor","raw_affiliation_strings":["TRLabs, #800 Park Plaza, 10611 98 Avenue, Education, Alberta, Canada T5K 2P7"],"affiliations":[{"raw_affiliation_string":"TRLabs, #800 Park Plaza, 10611 98 Avenue, Education, Alberta, Canada T5K 2P7","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5087988640","display_name":"W.D. Grover","orcid":null},"institutions":[{"id":"https://openalex.org/I154425047","display_name":"University of Alberta","ror":"https://ror.org/0160cpw27","country_code":"CA","type":"education","lineage":["https://openalex.org/I154425047"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"W. D. Grover","raw_affiliation_strings":["TRLabs, #800 Park Plaza, 10611 98 Avenue, Edmonton, Alberta, Canada T5K 2P7 and Department of Electrical Engineering, University of Alberta, Edmonton, Alberta, Canada"],"affiliations":[{"raw_affiliation_string":"TRLabs, #800 Park Plaza, 10611 98 Avenue, Edmonton, Alberta, Canada T5K 2P7 and Department of Electrical Engineering, University of Alberta, Edmonton, Alberta, Canada","institution_ids":["https://openalex.org/I154425047"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5029371742"],"corresponding_institution_ids":[],"apc_list":{"value":4220,"currency":"USD","value_usd":4220},"apc_paid":null,"fwci":0.5219,"has_fulltext":false,"cited_by_count":39,"citation_normalized_percentile":{"value":0.69152778,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"24","issue":"9","first_page":"823","last_page":"834"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.995199978351593,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.995199978351593,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.9854999780654907,"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/T10714","display_name":"Software-Defined Networks and 5G","score":0.9758999943733215,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.7609302401542664},{"id":"https://openalex.org/keywords/heap","display_name":"Heap (data structure)","score":0.7090319395065308},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6564745903015137},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6246265172958374},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5615914463996887},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.44659560918807983},{"id":"https://openalex.org/keywords/implementation","display_name":"Implementation","score":0.41706719994544983},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3209381103515625},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.31705549359321594},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.2651367783546448},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.24897155165672302}],"concepts":[{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.7609302401542664},{"id":"https://openalex.org/C134757568","wikidata":"https://www.wikidata.org/wiki/Q274089","display_name":"Heap (data structure)","level":2,"score":0.7090319395065308},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6564745903015137},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6246265172958374},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5615914463996887},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.44659560918807983},{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.41706719994544983},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3209381103515625},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.31705549359321594},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2651367783546448},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.24897155165672302},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/spe.4380240904","is_oa":false,"landing_page_url":"https://doi.org/10.1002/spe.4380240904","pdf_url":null,"source":{"id":"https://openalex.org/S122199241","display_name":"Software Practice and Experience","issn_l":"0038-0644","issn":["0038-0644","1097-024X"],"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":"Software: Practice and Experience","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.47999998927116394,"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W182208572","https://openalex.org/W1513400187","https://openalex.org/W1554451661","https://openalex.org/W1605077627","https://openalex.org/W1977119258","https://openalex.org/W2023367804","https://openalex.org/W2052455426","https://openalex.org/W2063317962","https://openalex.org/W2071734632","https://openalex.org/W2094004254","https://openalex.org/W2112932187","https://openalex.org/W2120450054","https://openalex.org/W2154434560","https://openalex.org/W2156194268","https://openalex.org/W2169528473","https://openalex.org/W2227557434","https://openalex.org/W3138807513"],"related_works":["https://openalex.org/W3209137076","https://openalex.org/W4223969905","https://openalex.org/W2374560440","https://openalex.org/W1490490684","https://openalex.org/W2887026015","https://openalex.org/W2361442013","https://openalex.org/W2373384475","https://openalex.org/W2990531685","https://openalex.org/W4310124294","https://openalex.org/W4318196244"],"abstract_inverted_index":{"Abstract":[0],"The":[1,80,257],"problem":[2],"of":[3,29,32,42,46,55,64,103,120,134,147,158,176,188,228,238,242,267],"finding":[4,30,65],"shortest":[5],"paths":[6,34,70,171,269],"arises":[7],"in":[8,73,83,137,197,211,252],"many":[9],"contexts;":[10],"testing":[11],"restoration":[12,33,72,274],"algorithms":[13,59],"and":[14,109,234,264,275],"developing":[15],"design":[16],"packages":[17],"for":[18,71,116,169,262,271],"large":[19],"telecommunications":[20,75,272,301],"networks":[21,255,302],"are":[22,163,167,303],"two":[23],"cases":[24],"where":[25],"the":[26,43,62,66,117,131,138,145,156,212,219,225,245,253,294],"simple":[27],"task":[28,63],"sets":[31],"can":[35,287],"consume":[36],"up":[37],"to":[38,61,99,111,154,290],"95":[39],"per":[40],"cent":[41],"execution":[44,198],"time":[45,210],"an":[47,100,112,240],"application":[48],"program.":[49],"This":[50],"paper":[51],"presents":[52],"experimental":[53],"studies":[54],"several":[56,97,170],"well\u2010known":[57],"shortest\u2010paths":[58],"adapted":[60],"k\u2010successively\u2010shortest":[67],"link\u2010disjoint":[68],"replacement":[69],"a":[74,135,152,173,195,201,236],"network":[76,273,277],"with":[77,123,151],"n":[78,106,231],"nodes.":[79,189],"implementations":[81],"range":[82],"complexity":[84,227],"from":[85,218],"O":[86,104,113,247],"(kn":[87,248],"2":[88,249],")":[89,250],"when":[90],"based":[91],"on":[92],"Dijkstra's":[93],"original":[94],"method,":[95],"through":[96],"improvements":[98],"efficient":[101],"implementation":[102,115,251,259,296],"(kn[v+long":[105],"])":[107],"complexity,":[108],"finally":[110],"(kn)":[114],"special":[118],"case":[119],"edge\u2010sparse":[121],"graphs":[122],"small":[124,283],"integer":[125,284],"edge":[126],"weights.":[127],"Here":[128],"v":[129],"is":[130,260,297],"maximum":[132],"degree":[133],"node":[136],"network.":[139],"Several":[140],"alternatives":[141,162],"were":[142],"tested":[143],"during":[144],"course":[146],"these":[148],"studies,":[149],"particularly":[150],"view":[153],"minimizing":[155],"number":[157],"heap":[159,204],"updates,":[160],"These":[161],"possible":[164],"because":[165],"we":[166],"searching":[168],"between":[172,183],"given":[174],"pair":[175],"nodes,":[177],"rather":[178],"than":[179],"just":[180],"one":[181,184],"path":[182],"or":[185,282],"more":[186,202],"pairs":[187],"Two":[190],"fairly":[191],"straightforward":[192],"changes":[193],"yield":[194],"decrease":[196],"time,":[199],"whereas":[200],"complex":[203],"management":[205],"strategy":[206],"consumes":[207],"as":[208,215,299],"much":[209],"added":[213],"code":[214],"it":[216],"releases":[217],"main":[220],"routine.":[221],"Experimental":[222],"results":[223],"confirm":[224],"theoretical":[226],"q":[229],"k":[230],"log":[232],"n)":[233],"demonstrate":[235],"speed\u2010up":[237],"nearly":[239],"order":[241],"magnitude":[243],"over":[244],"simpler":[246],"largest":[254],"tested.":[256],"optimized":[258],"recommended":[261],"planning":[263],"operational":[265],"applications":[266],"k\u2010shortest":[268],"rerouting":[270],"restorable":[276],"design.":[278],"If":[279],"hop":[280],"counts":[281],"link":[285],"weights":[286],"be":[288],"used":[289],"measure":[291],"distances,":[292],"then":[293],"qkn)":[295],"recommended,":[298],"typical":[300],"edge\u2010sparse.":[304]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}