{"id":"https://openalex.org/W2164878175","doi":"https://doi.org/10.1109/infcom.2004.1354541","title":"On finding disjoint paths in single and dual link cost networks","display_name":"On finding disjoint paths in single and dual link cost networks","publication_year":2004,"publication_date":"2004-12-23","ids":{"openalex":"https://openalex.org/W2164878175","doi":"https://doi.org/10.1109/infcom.2004.1354541","mag":"2164878175"},"language":"en","primary_location":{"id":"doi:10.1109/infcom.2004.1354541","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcom.2004.1354541","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2004","raw_type":"proceedings-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/A5110378030","display_name":"Dahai Xu","orcid":null},"institutions":[{"id":"https://openalex.org/I63190737","display_name":"University at Buffalo, State University of New York","ror":"https://ror.org/01y64my43","country_code":"US","type":"education","lineage":["https://openalex.org/I63190737"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Dahai Xu","raw_affiliation_strings":["Department of Computer Science and Engineering, State University of New York at Buffalo, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, State University of New York at Buffalo, USA","institution_ids":["https://openalex.org/I63190737"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100350473","display_name":"Yang Chen","orcid":"https://orcid.org/0000-0003-0578-2016"},"institutions":[{"id":"https://openalex.org/I63190737","display_name":"University at Buffalo, State University of New York","ror":"https://ror.org/01y64my43","country_code":"US","type":"education","lineage":["https://openalex.org/I63190737"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yang Chen","raw_affiliation_strings":["Department of Computer Science and Engineering, State University of New York at Buffalo, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, State University of New York at Buffalo, USA","institution_ids":["https://openalex.org/I63190737"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5109220607","display_name":"Yizhi Xiong","orcid":null},"institutions":[{"id":"https://openalex.org/I63190737","display_name":"University at Buffalo, State University of New York","ror":"https://ror.org/01y64my43","country_code":"US","type":"education","lineage":["https://openalex.org/I63190737"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yizhi Xiong","raw_affiliation_strings":["Department of Computer Science and Engineering, State University of New York at Buffalo, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, State University of New York at Buffalo, USA","institution_ids":["https://openalex.org/I63190737"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100728176","display_name":"Chunming Qiao","orcid":"https://orcid.org/0000-0002-4679-6572"},"institutions":[{"id":"https://openalex.org/I63190737","display_name":"University at Buffalo, State University of New York","ror":"https://ror.org/01y64my43","country_code":"US","type":"education","lineage":["https://openalex.org/I63190737"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Chunming Qiao","raw_affiliation_strings":["Department of Computer Science and Engineering, State University of New York at Buffalo"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, State University of New York at Buffalo","institution_ids":["https://openalex.org/I63190737"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5074983702","display_name":"Xin He","orcid":"https://orcid.org/0000-0002-3904-0478"},"institutions":[{"id":"https://openalex.org/I63190737","display_name":"University at Buffalo, State University of New York","ror":"https://ror.org/01y64my43","country_code":"US","type":"education","lineage":["https://openalex.org/I63190737"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Xin He","raw_affiliation_strings":["Department of Computer Science and Engineering, State University of New York at Buffalo, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, State University of New York at Buffalo, USA","institution_ids":["https://openalex.org/I63190737"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5110378030"],"corresponding_institution_ids":["https://openalex.org/I63190737"],"apc_list":null,"apc_paid":null,"fwci":5.5621,"has_fulltext":false,"cited_by_count":80,"citation_normalized_percentile":{"value":0.96263969,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"1","issue":null,"first_page":"705","last_page":"715"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10714","display_name":"Software-Defined Networks and 5G","score":0.9976999759674072,"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"}},"topics":[{"id":"https://openalex.org/T10714","display_name":"Software-Defined Networks and 5G","score":0.9976999759674072,"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.9965000152587891,"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/T10138","display_name":"Network Traffic and Congestion Control","score":0.9767000079154968,"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/computer-science","display_name":"Computer science","score":0.7312152981758118},{"id":"https://openalex.org/keywords/backup","display_name":"Backup","score":0.7140644788742065},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.6317840218544006},{"id":"https://openalex.org/keywords/path-protection","display_name":"Path protection","score":0.6296976208686829},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5509778261184692},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5463699102401733},{"id":"https://openalex.org/keywords/bandwidth","display_name":"Bandwidth (computing)","score":0.4780638515949249},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.466702938079834},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.4588187336921692},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4518928825855255},{"id":"https://openalex.org/keywords/link","display_name":"Link (geometry)","score":0.4297165870666504},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.38213807344436646},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.38155460357666016},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3292863965034485},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.2821614146232605},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2555586099624634},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2135504186153412},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.18727967143058777},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.15420487523078918},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.09372884035110474}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7312152981758118},{"id":"https://openalex.org/C2780945871","wikidata":"https://www.wikidata.org/wiki/Q194274","display_name":"Backup","level":2,"score":0.7140644788742065},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6317840218544006},{"id":"https://openalex.org/C2781040381","wikidata":"https://www.wikidata.org/wiki/Q17105208","display_name":"Path protection","level":4,"score":0.6296976208686829},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5509778261184692},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5463699102401733},{"id":"https://openalex.org/C2776257435","wikidata":"https://www.wikidata.org/wiki/Q1576430","display_name":"Bandwidth (computing)","level":2,"score":0.4780638515949249},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.466702938079834},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.4588187336921692},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4518928825855255},{"id":"https://openalex.org/C2778753846","wikidata":"https://www.wikidata.org/wiki/Q6554239","display_name":"Link (geometry)","level":2,"score":0.4297165870666504},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.38213807344436646},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.38155460357666016},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3292863965034485},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.2821614146232605},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2555586099624634},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2135504186153412},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.18727967143058777},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.15420487523078918},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.09372884035110474},{"id":"https://openalex.org/C160724564","wikidata":"https://www.wikidata.org/wiki/Q1620670","display_name":"Wavelength-division multiplexing","level":3,"score":0.0},{"id":"https://openalex.org/C49040817","wikidata":"https://www.wikidata.org/wiki/Q193091","display_name":"Optoelectronics","level":1,"score":0.0},{"id":"https://openalex.org/C6260449","wikidata":"https://www.wikidata.org/wiki/Q41364","display_name":"Wavelength","level":2,"score":0.0},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/infcom.2004.1354541","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcom.2004.1354541","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2004","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":36,"referenced_works":["https://openalex.org/W1524993602","https://openalex.org/W1622251338","https://openalex.org/W1795183293","https://openalex.org/W1894750005","https://openalex.org/W1963096432","https://openalex.org/W1964119857","https://openalex.org/W1997556033","https://openalex.org/W2003160050","https://openalex.org/W2011282943","https://openalex.org/W2019637647","https://openalex.org/W2043085438","https://openalex.org/W2092644422","https://openalex.org/W2096701045","https://openalex.org/W2113963729","https://openalex.org/W2119433111","https://openalex.org/W2122038079","https://openalex.org/W2122754121","https://openalex.org/W2154434560","https://openalex.org/W2155061423","https://openalex.org/W2158685305","https://openalex.org/W2161066687","https://openalex.org/W2164057590","https://openalex.org/W2172061951","https://openalex.org/W2176703625","https://openalex.org/W2272212872","https://openalex.org/W2483602637","https://openalex.org/W2752885492","https://openalex.org/W2781894692","https://openalex.org/W3145128584","https://openalex.org/W4210463984","https://openalex.org/W4285719527","https://openalex.org/W6631587015","https://openalex.org/W6636592575","https://openalex.org/W6678257822","https://openalex.org/W6684362852","https://openalex.org/W6747493321"],"related_works":["https://openalex.org/W2955195711","https://openalex.org/W2354454611","https://openalex.org/W2993266126","https://openalex.org/W2392283887","https://openalex.org/W2351388597","https://openalex.org/W2829881200","https://openalex.org/W2184647741","https://openalex.org/W1991341565","https://openalex.org/W2782994307","https://openalex.org/W2128090945"],"abstract_inverted_index":{"Finding":[0],"a":[1,31,59,94,116,143,160,238],"disjoint":[2,32],"path":[3,21,33,42,201,217],"pair":[4,34],"is":[5,15,27,50,67,90,105,165],"an":[6,124,166],"important":[7],"component":[8],"in":[9,69,123,180],"survivable":[10],"networks.":[11,86],"Since":[12],"the":[13,18,24,37,40,47,97,112,120,137,154,170,184,194,242],"traffic":[14],"carried":[16],"on":[17],"active":[19,48],"(working)":[20],"most":[22],"of":[23,39,115,119,182,212],"time,":[25],"it":[26,89],"useful":[28],"to":[29,92,96,107,193,197],"find":[30],"such":[35,58],"that":[36,64,221],"length":[38],"shorter":[41],"(to":[43],"be":[44],"used":[45],"as":[46,208,210],"path)":[49],"minimized.":[51],"In":[52,87],"this":[53,65],"paper,":[54],"we":[55,141],"first":[56],"address":[57],"minmin":[60,138,171],"problem.":[61],"We":[62,189,219],"prove":[63],"problem":[66,122,139,172,196],"NP-complete":[68],"either":[70],"single":[71],"link":[72,80,148],"cost":[73,81,130],"(e.g.":[74,82],"dedicated":[75],"backup":[76,84],"bandwidth)":[77,85],"or":[78],"dual":[79,129],"shared":[83,200,216],"addition,":[88],"NP-hard":[91],"obtain":[93],"k-approximation":[95],"optimal":[98],"solution":[99],"for":[100,169,215],"any":[101],"k>1.":[102],"Our":[103],"proof":[104],"extended":[106],"another":[108],"open":[109],"question":[110],"regarding":[111],"computational":[113],"complexity":[114],"restricted":[117],"version":[118],"min-sum":[121],"undirected":[125],"network":[126],"with":[127],"ordered":[128],"links":[131],"(called":[132],"MSOD":[133,195],"problem).":[134],"To":[135],"solve":[136],"efficiently,":[140],"introduce":[142],"novel":[144],"concept":[145],"called":[146,173],"conflicting":[147],"set":[149],"which":[150,175],"provides":[151],"insights":[152],"into":[153],"so-called":[155],"trap":[156],"problem,":[157],"and":[158,186,203,247],"develop":[159],"divide-and-conquer":[161],"strategy.":[162],"The":[163],"result":[164],"effective":[167],"heuristic":[168],"COLE,":[174],"can":[176],"outperform":[177],"other":[178],"approaches":[179,234],"terms":[181],"both":[183],"optimality":[185],"running":[187],"time.":[188,249],"also":[190,236],"apply":[191],"COLE":[192,222],"efficiently":[198],"provide":[199],"protection":[202],"conduct":[204],"comprehensive":[205],"performance":[206],"evaluation":[207],"well":[209],"comparison":[211],"various":[213],"schemes":[214],"protection.":[218],"show":[220],"not":[223],"only":[224],"processes":[225],"connection":[226],"requests":[227],"much":[228],"faster":[229],"than":[230],"existing":[231],"ILP":[232],"based":[233],"but":[235],"achieves":[237],"good":[239],"balance":[240],"among":[241],"AP":[243],"length,":[244],"bandwidth":[245],"efficiency":[246],"recovery":[248]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":7},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}