{"id":"https://openalex.org/W2540978065","doi":"https://doi.org/10.1109/rndm.2016.7608281","title":"An efficient heuristic for calculating a protected path with specified nodes","display_name":"An efficient heuristic for calculating a protected path with specified nodes","publication_year":2016,"publication_date":"2016-09-01","ids":{"openalex":"https://openalex.org/W2540978065","doi":"https://doi.org/10.1109/rndm.2016.7608281","mag":"2540978065"},"language":"en","primary_location":{"id":"doi:10.1109/rndm.2016.7608281","is_oa":false,"landing_page_url":"https://doi.org/10.1109/rndm.2016.7608281","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 8th International Workshop on Resilient Networks Design and Modeling (RNDM)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5037870241","display_name":"L\u00facia Martins","orcid":"https://orcid.org/0000-0002-6534-0159"},"institutions":[{"id":"https://openalex.org/I4210125590","display_name":"Institute for Systems Engineering and Computers","ror":"https://ror.org/033wn8m60","country_code":"PT","type":"nonprofit","lineage":["https://openalex.org/I4210125590"]},{"id":"https://openalex.org/I76903346","display_name":"University of Coimbra","ror":"https://ror.org/04z8k9a98","country_code":"PT","type":"education","lineage":["https://openalex.org/I76903346"]}],"countries":["PT"],"is_corresponding":false,"raw_author_name":"Lucia Martins","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Coimbra, Coimbra, Portugal","INESC Coimbra, DEEC, Coimbra, Portugal"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Coimbra, Coimbra, Portugal","institution_ids":["https://openalex.org/I76903346"]},{"raw_affiliation_string":"INESC Coimbra, DEEC, Coimbra, Portugal","institution_ids":["https://openalex.org/I4210125590"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5062640364","display_name":"Teresa Gomes","orcid":"https://orcid.org/0000-0002-3084-5608"},"institutions":[{"id":"https://openalex.org/I4210125590","display_name":"Institute for Systems Engineering and Computers","ror":"https://ror.org/033wn8m60","country_code":"PT","type":"nonprofit","lineage":["https://openalex.org/I4210125590"]},{"id":"https://openalex.org/I76903346","display_name":"University of Coimbra","ror":"https://ror.org/04z8k9a98","country_code":"PT","type":"education","lineage":["https://openalex.org/I76903346"]}],"countries":["PT"],"is_corresponding":false,"raw_author_name":"Teresa Gomes","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Coimbra, Coimbra, Portugal","INESC Coimbra, DEEC, Coimbra, Portugal"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Coimbra, Coimbra, Portugal","institution_ids":["https://openalex.org/I76903346"]},{"raw_affiliation_string":"INESC Coimbra, DEEC, Coimbra, Portugal","institution_ids":["https://openalex.org/I4210125590"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5083599909","display_name":"David Tipper","orcid":"https://orcid.org/0000-0002-9429-6425"},"institutions":[{"id":"https://openalex.org/I170201317","display_name":"University of Pittsburgh","ror":"https://ror.org/01an3r305","country_code":"US","type":"education","lineage":["https://openalex.org/I170201317"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"David Tipper","raw_affiliation_strings":["Graduate Telecommunications and Networking Program, University of Pittsburgh, Pittsburgh, PA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Graduate Telecommunications and Networking Program, University of Pittsburgh, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I170201317"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.6145,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.81492226,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"150","last_page":"157"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.9998999834060669,"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.9998999834060669,"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/T10714","display_name":"Software-Defined Networks and 5G","score":0.9994999766349792,"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/T10138","display_name":"Network Traffic and Congestion Control","score":0.9987000226974487,"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/heuristics","display_name":"Heuristics","score":0.7662293910980225},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7082194685935974},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6766059398651123},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6588270664215088},{"id":"https://openalex.org/keywords/survivability","display_name":"Survivability","score":0.626539945602417},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5963909029960632},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.557185173034668},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.5462921261787415},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5436446666717529},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.530362606048584},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5272806286811829},{"id":"https://openalex.org/keywords/backup","display_name":"Backup","score":0.47835037112236023},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.4699578285217285},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.45959386229515076},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.4131873846054077},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3331668972969055},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.2753804922103882},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.21818777918815613},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2013096809387207},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.12209874391555786}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7662293910980225},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7082194685935974},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6766059398651123},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6588270664215088},{"id":"https://openalex.org/C2781133158","wikidata":"https://www.wikidata.org/wiki/Q1088669","display_name":"Survivability","level":2,"score":0.626539945602417},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5963909029960632},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.557185173034668},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.5462921261787415},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5436446666717529},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.530362606048584},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5272806286811829},{"id":"https://openalex.org/C2780945871","wikidata":"https://www.wikidata.org/wiki/Q194274","display_name":"Backup","level":2,"score":0.47835037112236023},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.4699578285217285},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.45959386229515076},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.4131873846054077},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3331668972969055},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.2753804922103882},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.21818777918815613},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2013096809387207},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.12209874391555786},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","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/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/rndm.2016.7608281","is_oa":false,"landing_page_url":"https://doi.org/10.1109/rndm.2016.7608281","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 8th International Workshop on Resilient Networks Design and Modeling (RNDM)","raw_type":"proceedings-article"},{"id":"pmh:oai:d-scholarship.pitt.edu:32581","is_oa":false,"landing_page_url":"https://d-scholarship.pitt.edu/32581/7/licence.txt","pdf_url":null,"source":{"id":"https://openalex.org/S4306402372","display_name":"D-Scholarship@Pitt (University of Pittsburgh)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I170201317","host_organization_name":"University of Pittsburgh","host_organization_lineage":["https://openalex.org/I170201317"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":null,"raw_type":"Article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1811856421","https://openalex.org/W1914921536","https://openalex.org/W1965039153","https://openalex.org/W1980156780","https://openalex.org/W1982904363","https://openalex.org/W2011282943","https://openalex.org/W2040823429","https://openalex.org/W2041947644","https://openalex.org/W2119967662","https://openalex.org/W2144050074","https://openalex.org/W2151842399","https://openalex.org/W2155526624","https://openalex.org/W2296019917","https://openalex.org/W2346338475","https://openalex.org/W2613070411"],"related_works":["https://openalex.org/W2018581325","https://openalex.org/W2066023846","https://openalex.org/W2776102956","https://openalex.org/W4382866750","https://openalex.org/W4293167680","https://openalex.org/W4387185483","https://openalex.org/W2018146256","https://openalex.org/W2022506245","https://openalex.org/W4399175858","https://openalex.org/W2040572217"],"abstract_inverted_index":{"The":[0,107,136],"problem":[1],"of":[2,22,73,109,132,149],"determining":[3],"a":[4,10,20,48,61,65,70,76,103,113,143,146],"path":[5,98,114],"between":[6],"two":[7],"nodes":[8,17,32,74],"in":[9,19,75,145,152,177],"network":[11],"that":[12,68,95],"must":[13],"visit":[14,31],"specific":[15],"intermediate":[16],"arises":[18],"number":[21],"contexts.":[23],"For":[24],"example,":[25],"one":[26],"might":[27],"require":[28],"traffic":[29],"to":[30,64,80,83,93,141],"where":[33],"it":[34],"can":[35,99],"be":[36,100],"monitored":[37],"by":[38,102,121],"deep":[39],"packet":[40],"inspection":[41],"for":[42,54,130,159,164],"security":[43],"reasons.":[44],"In":[45,78],"this":[46],"paper":[47],"new":[49],"recursive":[50],"heuristic":[51,90],"is":[52,91,119],"proposed":[53,89],"finding":[55],"the":[56,86,88,96,110,133,157,178],"shortest":[57],"loopless":[58],"path,":[59,87],"from":[60],"source":[62],"node":[63],"target":[66],"node,":[67],"visits":[69],"specified":[71],"set":[72],"network.":[77],"order":[79],"provide":[81],"survivability":[82],"failures":[84],"along":[85],"modified":[92],"ensure":[94],"calculated":[97],"protected":[101],"node-disjoint":[104],"backup":[105],"path.":[106],"performance":[108],"heuristic,":[111],"calculating":[112],"with":[115,123,174],"and":[116],"without":[117],"protection,":[118],"evaluated":[120],"comparing":[122],"an":[124],"integer":[125],"linear":[126],"programming":[127],"(ILP)":[128],"formulation":[129],"each":[131],"considered":[134],"problems.":[135,167],"ILP":[137],"solver":[138],"may":[139],"fail":[140],"obtain":[142],"solution":[144],"reasonable":[147],"amount":[148],"time,":[150],"especially":[151],"large":[153],"networks,":[154],"which":[155],"justifies":[156],"need":[158],"effective,":[160],"computationally":[161],"efficient":[162],"heuristics":[163,176],"solving":[165],"these":[166],"Our":[168],"numerical":[169],"results":[170],"are":[171],"also":[172],"compared":[173],"previous":[175],"literature.":[179]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}