{"id":"https://openalex.org/W2066862700","doi":"https://doi.org/10.1109/icumt.2013.6798424","title":"Finding the shortest node-disjoint pair of paths that are allowed to share resilient arcs","display_name":"Finding the shortest node-disjoint pair of paths that are allowed to share resilient arcs","publication_year":2013,"publication_date":"2013-09-01","ids":{"openalex":"https://openalex.org/W2066862700","doi":"https://doi.org/10.1109/icumt.2013.6798424","mag":"2066862700"},"language":"en","primary_location":{"id":"doi:10.1109/icumt.2013.6798424","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icumt.2013.6798424","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 5th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT)","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/A5062640364","display_name":"Teresa Gomes","orcid":"https://orcid.org/0000-0002-3084-5608"},"institutions":[{"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","Dept. of Electr. & Comput. Eng., Univ. of Coimbra, 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":"Dept. of Electr. & Comput. Eng., Univ. of Coimbra, Coimbra, , Portugal","institution_ids":["https://openalex.org/I76903346"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072909966","display_name":"Mateusz \u017botkiewicz","orcid":"https://orcid.org/0000-0003-3157-3015"},"institutions":[{"id":"https://openalex.org/I108403487","display_name":"Warsaw University of Technology","ror":"https://ror.org/00y0xnp53","country_code":"PL","type":"education","lineage":["https://openalex.org/I108403487"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Mateusz Zotkiewicz","raw_affiliation_strings":["Institute of Telecommunications, Warsaw University of Technology, Warszawa, Poland","[Inst. of Telecommun., Warsaw Univ. of Technol., Warsaw, Poland]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Telecommunications, Warsaw University of Technology, Warszawa, Poland","institution_ids":["https://openalex.org/I108403487"]},{"raw_affiliation_string":"[Inst. of Telecommun., Warsaw Univ. of Technol., Warsaw, Poland]","institution_ids":["https://openalex.org/I108403487"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4053,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.55809938,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"179","last_page":"186"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.9991999864578247,"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.9991999864578247,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9470999836921692,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9210000038146973,"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/disjoint-sets","display_name":"Disjoint sets","score":0.7683669328689575},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6777075529098511},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.6650981307029724},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.6037235260009766},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5068803429603577},{"id":"https://openalex.org/keywords/floyd\u2013warshall-algorithm","display_name":"Floyd\u2013Warshall algorithm","score":0.4928262531757355},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4192591905593872},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4088231325149536},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.37785449624061584},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.33061766624450684},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.3243505656719208},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.3104342818260193},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.26884788274765015},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.25440168380737305},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.07430613040924072}],"concepts":[{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.7683669328689575},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6777075529098511},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.6650981307029724},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6037235260009766},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5068803429603577},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.4928262531757355},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4192591905593872},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4088231325149536},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.37785449624061584},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.33061766624450684},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3243505656719208},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.3104342818260193},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.26884788274765015},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.25440168380737305},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.07430613040924072},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"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/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icumt.2013.6798424","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icumt.2013.6798424","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 5th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W51079787","https://openalex.org/W1488182941","https://openalex.org/W1636629214","https://openalex.org/W1682076822","https://openalex.org/W1966767592","https://openalex.org/W1971812920","https://openalex.org/W2011282943","https://openalex.org/W2108413500","https://openalex.org/W2110345842","https://openalex.org/W2128090945","https://openalex.org/W2136540980","https://openalex.org/W2137734857","https://openalex.org/W2155061423","https://openalex.org/W2155526624","https://openalex.org/W2163722844","https://openalex.org/W2286743186","https://openalex.org/W2491603509","https://openalex.org/W2613070411","https://openalex.org/W4206526140","https://openalex.org/W4210463984","https://openalex.org/W6629264399","https://openalex.org/W6636876309","https://openalex.org/W6676306173","https://openalex.org/W6683958974","https://openalex.org/W6806998643"],"related_works":["https://openalex.org/W2354846196","https://openalex.org/W4293054712","https://openalex.org/W2391130892","https://openalex.org/W2360981904","https://openalex.org/W2348761196","https://openalex.org/W2347245430","https://openalex.org/W1617152041","https://openalex.org/W2392078542","https://openalex.org/W1519427079","https://openalex.org/W2597144308"],"abstract_inverted_index":{"We":[0,89],"have":[1],"solved":[2],"a":[3,22,26,31,36],"problem":[4],"of":[5,11,25,28,33,38,51],"finding":[6],"the":[7,48,71,78,86,91],"shortest":[8,49],"node-disjoint":[9],"pair":[10,50],"paths":[12,52,73],"that":[13,21,54,60,70],"can":[14],"share":[15,56],"resilient":[16,65],"arcs.":[17,34,66],"It":[18],"is":[19,45],"assumed":[20],"network":[23],"consists":[24],"set":[27,32],"nodes":[29,59],"and":[30,94],"Moreover,":[35],"number":[37],"available":[39],"arcs":[40],"are":[41,61],"resilient.":[42],"Our":[43],"goal":[44],"to":[46,63,97],"find":[47],"such":[53],"they":[55],"only":[57],"those":[58],"incident":[62],"shared":[64],"Furthermore,":[67],"we":[68,80],"assume":[69],"resulting":[72],"cannot":[74],"contain":[75],"loops.":[76],"In":[77],"paper":[79],"present":[81],"two":[82],"novel":[83],"algorithms":[84,93],"solving":[85],"above":[87],"problem.":[88],"implement":[90],"proposed":[92],"compare":[95],"them":[96],"an":[98],"MIP":[99],"approach.":[100]},"counts_by_year":[{"year":2014,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}