{"id":"https://openalex.org/W2017449646","doi":"https://doi.org/10.1109/rndm.2014.7014925","title":"A heuristic for widest edge-disjoint path pair lexicographic optimization","display_name":"A heuristic for widest edge-disjoint path pair lexicographic optimization","publication_year":2014,"publication_date":"2014-11-01","ids":{"openalex":"https://openalex.org/W2017449646","doi":"https://doi.org/10.1109/rndm.2014.7014925","mag":"2017449646"},"language":"en","primary_location":{"id":"doi:10.1109/rndm.2014.7014925","doi":"https://doi.org/10.1109/rndm.2014.7014925","is_oa":false,"landing_page_url":"https://doi.org/10.1109/rndm.2014.7014925","pdf_url":null,"source":{"id":"https://openalex.org/S7407086038","display_name":"International Workshop on Resilient Networks Design and Modeling (RNDM)","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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 6th International Workshop on Reliable Networks Design and Modeling (RNDM)","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://estudogeral.uc.pt/bitstream/10316/95048/1/Cruz_Gomes_Medhi_RNDM2014_EstudoGeral.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5102989842","display_name":"Pedro Cruz","orcid":"https://orcid.org/0000-0001-8813-0632","observed_orcids":["https://orcid.org/0000-0001-8813-0632"]},"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":"Pedro Cruz","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University 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"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5062640364","display_name":"Teresa Gomes","orcid":"https://orcid.org/0000-0002-3084-5608","observed_orcids":["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","INESC 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":"INESC Coimbra, Coimbra, Portugal","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5071674500","display_name":"Deep Medhi","orcid":"https://orcid.org/0000-0003-4109-0658","observed_orcids":["https://orcid.org/0000-0003-4109-0658"]},"institutions":[{"id":"https://openalex.org/I75421653","display_name":"University of Missouri\u2013Kansas City","ror":"https://ror.org/01w0d5g70","country_code":"US","type":"education","lineage":["https://openalex.org/I75421653"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Deep Medhi","raw_affiliation_strings":["Computer Science & Electrical Engineering Department, University of Missouri-Kansas, Kansas City, Missouri, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science & Electrical Engineering Department, University of Missouri-Kansas, Kansas City, Missouri, USA","institution_ids":["https://openalex.org/I75421653"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":14,"citation_normalized_percentile":{"value":0.10232336,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"9","last_page":"15"},"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.6279000043869019,"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.6279000043869019,"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/T10138","display_name":"Network Traffic and Congestion Control","score":0.34450000524520874,"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/T10847","display_name":"Advanced Optical Network Technologies","score":0.015599999576807022,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/edge-disjoint-paths","display_name":"edge-disjoint paths","score":0.8840000033378601},{"id":"https://openalex.org/keywords/lexicographic-optimization","display_name":"lexicographic optimization","score":0.8640000224113464},{"id":"https://openalex.org/keywords/path-protection","display_name":"path protection","score":0.5789999961853027},{"id":"https://openalex.org/keywords/backup-paths","display_name":"backup paths","score":0.7459999918937683},{"id":"https://openalex.org/keywords/multipath-routing","display_name":"multipath routing","score":0.7089999914169312},{"id":"https://openalex.org/keywords/heuristic-algorithms","display_name":"heuristic algorithms","score":0.6679999828338623},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"quality of service","score":0.7409999966621399},{"id":"https://openalex.org/keywords/telecommunications-networks","display_name":"telecommunications networks","score":0.7160000205039978}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7756791710853577},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6158416867256165},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6067089438438416},{"id":"https://openalex.org/C2776257435","wikidata":"https://www.wikidata.org/wiki/Q1576430","display_name":"Bandwidth (computing)","level":2,"score":0.5990328192710876},{"id":"https://openalex.org/C2780945871","wikidata":"https://www.wikidata.org/wiki/Q194274","display_name":"Backup","level":2,"score":0.5919450521469116},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5475748777389526},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.5070858001708984},{"id":"https://openalex.org/C159254197","wikidata":"https://www.wikidata.org/wiki/Q1144915","display_name":"Lexicographical order","level":2,"score":0.4889279901981354},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.4697345197200775},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.42960885167121887},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4235057830810547},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4119945168495178},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3928762674331665},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.3843746781349182},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34818875789642334},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.21818256378173828},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.14577892422676086},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.07783207297325134},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.06640100479125977},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/rndm.2014.7014925","doi":"https://doi.org/10.1109/rndm.2014.7014925","is_oa":false,"landing_page_url":"https://doi.org/10.1109/rndm.2014.7014925","pdf_url":null,"source":{"id":"https://openalex.org/S7407086038","display_name":"International Workshop on Resilient Networks Design and Modeling (RNDM)","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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 6th International Workshop on Reliable Networks Design and Modeling (RNDM)","raw_type":"proceedings-article"},{"id":"pmh:oai:estudogeral.uc.pt:10316/95048","doi":null,"is_oa":true,"landing_page_url":"https://hdl.handle.net/10316/95048","pdf_url":"https://estudogeral.uc.pt/bitstream/10316/95048/1/Cruz_Gomes_Medhi_RNDM2014_EstudoGeral.pdf","source":{"id":"https://openalex.org/S4306402433","display_name":"Portuguese National Funding Agency for Science, Research and Technology (RCAAP Project by FCT)","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":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"journal article"},{"id":"pmh:oai:estudogeral.sib.uc.pt:10316/95048","doi":null,"is_oa":true,"landing_page_url":"http://hdl.handle.net/10316/95048","pdf_url":null,"source":{"id":"https://openalex.org/S4306402433","display_name":"Portuguese National Funding Agency for Science, Research and Technology (RCAAP Project by FCT)","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":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"http://purl.org/coar/resource_type/c_6501"}],"best_oa_location":{"id":"pmh:oai:estudogeral.uc.pt:10316/95048","doi":null,"is_oa":true,"landing_page_url":"https://hdl.handle.net/10316/95048","pdf_url":"https://estudogeral.uc.pt/bitstream/10316/95048/1/Cruz_Gomes_Medhi_RNDM2014_EstudoGeral.pdf","source":{"id":"https://openalex.org/S4306402433","display_name":"Portuguese National Funding Agency for Science, Research and Technology (RCAAP Project by FCT)","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":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"journal article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure","score":0.428600013256073}],"study_designs":[],"awards":[{"id":"https://openalex.org/G1515873793","display_name":null,"funder_award_id":"PEst\u2010OE/EEI/UI308/2014","funder_id":"https://openalex.org/F4320334779","funder_display_name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia"},{"id":"https://openalex.org/G3655400826","display_name":"Encaminhamento Multicrit\u00e9rio em Redes MPLS e WDM","funder_award_id":"PTDC/EEA-TEL/101884/2008","funder_id":"https://openalex.org/F4320334779","funder_display_name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia"},{"id":"https://openalex.org/G5907161532","display_name":"NeTS: Small: Collaborative Research: Resilient Network Design for Massive Failures and Attacks","funder_award_id":"1217736","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320323392","display_name":"Universidade de Coimbra","ror":"https://ror.org/04z8k9a98"},{"id":"https://openalex.org/F4320327374","display_name":"Programa Operacional Tem\u00e1tico Factores de Competitividade","ror":"https://ror.org/022rdnn95"},{"id":"https://openalex.org/F4320334779","display_name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia","ror":"https://ror.org/00snfqn58"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2017449646.pdf","grobid_xml":"https://content.openalex.org/works/W2017449646.grobid-xml"},"referenced_works_count":19,"referenced_works":["https://openalex.org/W100245444","https://openalex.org/W1524993602","https://openalex.org/W1530050527","https://openalex.org/W1538477406","https://openalex.org/W1977545325","https://openalex.org/W1982444805","https://openalex.org/W2085830191","https://openalex.org/W2096774592","https://openalex.org/W2103825520","https://openalex.org/W2108180468","https://openalex.org/W2133228819","https://openalex.org/W2154434560","https://openalex.org/W2155061423","https://openalex.org/W2155526624","https://openalex.org/W2169528473","https://openalex.org/W2613070411","https://openalex.org/W3163397523","https://openalex.org/W4210463984","https://openalex.org/W4213060235"],"related_works":["https://openalex.org/W2079495776","https://openalex.org/W2103825520","https://openalex.org/W2132220309","https://openalex.org/W332014493","https://openalex.org/W4313435997","https://openalex.org/W2975133607","https://openalex.org/W2917578555","https://openalex.org/W2800024708","https://openalex.org/W2785220787","https://openalex.org/W2108180468"],"abstract_inverted_index":{"Telecommunication":[0],"services":[1],"are":[2,9],"pervasive":[3],"in":[4,42,107],"today's":[5],"human":[6],"activity":[7],"and":[8,14,28,57,98],"required":[10],"to":[11,53],"offer":[12],"reliable":[13],"quality-of-service(QoS)-aware":[15],"guaranteed":[16],"services.":[17],"In":[18,86],"global":[19],"path":[20,24,52,73,106],"protection,":[21],"the":[22,43,50,62,68,72,80,101,104,108],"working":[23,51],"between":[25],"a":[26,29,35,46,89],"source":[27],"destination":[30],"can":[31],"be":[32,54],"protected":[33],"by":[34],"backup":[36],"path,":[37],"which":[38],"ensures":[39],"data":[40],"transfer":[41],"event":[44],"of":[45,64,71,77,82,103],"failure":[47],"that":[48],"makes":[49],"unavailable.":[55],"Multipath":[56],"disjoint":[58,65,84,96],"routing":[59],"may":[60],"require":[61],"calculation":[63,81],"paths":[66],"maximizing":[67,100],"total":[69],"bandwidth":[70,102],"pair":[74],"(or":[75],"set":[76],"paths)":[78],"or":[79],"maximum-bandwidth":[83,95],"paths.":[85],"this":[87,117],"paper,":[88],"lexicographic":[90],"optimization":[91],"problem":[92,118],"for":[93,115],"obtaining":[94],"paths,":[97],"then":[99],"widest":[105],"pair,":[109],"is":[110,119],"formalized.":[111],"An":[112],"effective":[113],"heuristic":[114],"addressing":[116],"presented.":[120]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":2}],"updated_date":"2026-10-27T15:51:10.671819","created_date":"2016-06-24T00:00:00"}