{"id":"https://openalex.org/W2085725603","doi":"https://doi.org/10.1002/net.3230220607","title":"Shortest path problems with node failures","display_name":"Shortest path problems with node failures","publication_year":1992,"publication_date":"1992-10-01","ids":{"openalex":"https://openalex.org/W2085725603","doi":"https://doi.org/10.1002/net.3230220607","mag":"2085725603"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230220607","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230220607","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/A5109246810","display_name":"Patrick Jaillet","orcid":"https://orcid.org/0000-0002-8585-6566"},"institutions":[{"id":"https://openalex.org/I4210155549","display_name":"Laboratoire de Math\u00e9matiques Blaise Pascal","ror":"https://ror.org/05sd5r855","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I198244214","https://openalex.org/I4210141950","https://openalex.org/I4210155549"]},{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["FR","US"],"is_corresponding":true,"raw_author_name":"Patrick Jaillet","raw_affiliation_strings":["MSIS Department The University of Texas at Austin and Laboratoire de Mathe\u0301matiques et Mode\u0301lisation ENPC, France","MSIS Department The University of Texas at Austin and Laboratoire de Math\u00e9matiques et Mod\u00e9lisation ENPC, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"MSIS Department The University of Texas at Austin and Laboratoire de Mathe\u0301matiques et Mode\u0301lisation ENPC, France","institution_ids":["https://openalex.org/I86519309","https://openalex.org/I4210155549"]},{"raw_affiliation_string":"MSIS Department The University of Texas at Austin and Laboratoire de Math\u00e9matiques et Mod\u00e9lisation ENPC, France","institution_ids":["https://openalex.org/I86519309"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5109246810"],"corresponding_institution_ids":["https://openalex.org/I4210155549","https://openalex.org/I86519309"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":1.9208,"has_fulltext":false,"cited_by_count":46,"citation_normalized_percentile":{"value":0.86566092,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"22","issue":"6","first_page":"589","last_page":"605"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9986000061035156,"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.9986000061035156,"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9940999746322632,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/T12288","display_name":"Optimization and Search Problems","score":0.993399977684021,"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/mathematics","display_name":"Mathematics","score":0.6378791332244873},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5989503264427185},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.5558715462684631},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.5512347221374512},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5509188175201416},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5382788777351379},{"id":"https://openalex.org/keywords/widest-path-problem","display_name":"Widest path problem","score":0.5335631370544434},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4750647246837616},{"id":"https://openalex.org/keywords/a-priori-and-a-posteriori","display_name":"A priori and a posteriori","score":0.4508771300315857},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2769925892353058},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2379264533519745},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.18820390105247498}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6378791332244873},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5989503264427185},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.5558715462684631},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.5512347221374512},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5509188175201416},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5382788777351379},{"id":"https://openalex.org/C83677490","wikidata":"https://www.wikidata.org/wiki/Q7998708","display_name":"Widest path problem","level":5,"score":0.5335631370544434},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4750647246837616},{"id":"https://openalex.org/C75553542","wikidata":"https://www.wikidata.org/wiki/Q178161","display_name":"A priori and a posteriori","level":2,"score":0.4508771300315857},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2769925892353058},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2379264533519745},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.18820390105247498},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"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/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","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":"doi:10.1002/net.3230220607","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230220607","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.650.4200","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.650.4200","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://web.mit.edu/jaillet/www/general/networks-pj-92.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.8199999928474426,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W304639949","https://openalex.org/W620344865","https://openalex.org/W1500165591","https://openalex.org/W1523334965","https://openalex.org/W1546027924","https://openalex.org/W2011039300","https://openalex.org/W2053913299","https://openalex.org/W2054812794","https://openalex.org/W2059014957","https://openalex.org/W2063301486","https://openalex.org/W2069323107","https://openalex.org/W2084224084","https://openalex.org/W2120881403","https://openalex.org/W2129557546","https://openalex.org/W2617045890","https://openalex.org/W3171412313"],"related_works":["https://openalex.org/W2776102956","https://openalex.org/W2237480599","https://openalex.org/W2018146256","https://openalex.org/W4382866750","https://openalex.org/W4293167680","https://openalex.org/W2375775343","https://openalex.org/W4299588719","https://openalex.org/W2020255949","https://openalex.org/W1817899449","https://openalex.org/W2600678155"],"abstract_inverted_index":{"Abstract":[0],"Consider":[1],"the":[2,6,28,34,47,76,78,83,89,94,113,122,128,169,173,184,205,211,224,227],"problem":[3,99,185],"of":[4,27,33,75,80,100,106,159,168,175,178,200,207,223,226],"finding":[5,101],"shortest":[7],"paths":[8],"from":[9,42,65],"a":[10,15,20,31,53,62,103,144,208,221],"node":[11,16],"source":[12],"s":[13,43,66],"to":[14,40,44,52,59,67],"sink":[17],"t":[18,45,68],"in":[19,187],"complete":[21],"network.":[22],"On":[23],"any":[24,72],"given":[25,54,73],"instance":[26,74],"problem,":[29,77],"only":[30,88],"subset":[32,48],"intermediate":[35],"nodes":[36,81,91,154],"can":[37,131],"be":[38,133],"used":[39,134],"go":[41],",":[46],"being":[49,96],"chosen":[50],"according":[51],"probability":[55,158],"law.":[56],"We":[57,180,202],"wish":[58],"find":[60],"an":[61,102,150],"priori":[63,104],"path":[64,84,105,152],"such":[69],"that,":[70],"on":[71],"sequence":[79],"defining":[82],"is":[85,110,124],"preserved":[86],"but":[87],"permissible":[90],"are":[92],"traversed,":[93],"others":[95],"skipped.":[97],"The":[98],"minimum":[107],"expected":[108],"length":[109,146],"defined":[111,148],"as":[112],"Probabilistic":[114,212],"Shortest":[115],"Path":[116],"Problem":[117,216],"(PSPP).":[118],"Note":[119],"that":[120,155,183],"if":[121,135],"network":[123],"not":[125],"originally":[126],"complete,":[127],"PSPP":[129],"methodology":[130],"still":[132],"we":[136,171,192,219],"first":[137,181],"add":[138],"each":[139],"missing":[140],"edge,":[141],"together":[142],"with":[143],"deterministic":[145],"(being":[147],"by":[149],"alternative":[151],"using":[153],"have":[156],"no":[157],"failure).":[160],"In":[161],"this":[162,176],"paper,":[163],"after":[164],"discussing":[165],"potential":[166],"applications":[167],"PSPP,":[170],"study":[172],"complexity":[174,206],"class":[177],"problems.":[179],"show":[182],"is,":[186],"general,":[188],"NP\u2010hard":[189],"and":[190],"then":[191],"develop":[193],"polynomial":[194],"time":[195],"procedures":[196],"for":[197],"special":[198],"cases":[199],"it.":[201],"also":[203],"consider":[204],"related":[209],"problem:":[210],"Minimum":[213],"Spanning":[214],"Tree":[215],"(PMSTP).":[217],"Finally,":[218],"provide":[220],"discussion":[222],"implications":[225],"results.":[228]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":4}],"updated_date":"2026-05-21T09:19:25.381259","created_date":"2025-10-10T00:00:00"}