{"id":"https://openalex.org/W2108311274","doi":"https://doi.org/10.1145/2069216.2069225","title":"An efficient exact algorithm for finding two link-disjoint paths with related path cost and QoS constraint","display_name":"An efficient exact algorithm for finding two link-disjoint paths with related path cost and QoS constraint","publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W2108311274","doi":"https://doi.org/10.1145/2069216.2069225","mag":"2108311274"},"language":"en","primary_location":{"id":"doi:10.1145/2069216.2069225","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2069216.2069225","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Second Symposium on Information and Communication Technology - SoICT '11","raw_type":"proceedings-article"},"type":"conference-abstract","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/A5025397806","display_name":"Phan-Thuan Do","orcid":null},"institutions":[{"id":"https://openalex.org/I94518387","display_name":"Hanoi University of Science and Technology","ror":"https://ror.org/04nyv3z04","country_code":"VN","type":"education","lineage":["https://openalex.org/I94518387"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Phan-Thuan Do","raw_affiliation_strings":["Hanoi University of Science and Technology, Hanoi, Vietnam","Hanoi University of science and technology, Hanoi, Vietnam"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Hanoi University of Science and Technology, Hanoi, Vietnam","institution_ids":["https://openalex.org/I94518387"]},{"raw_affiliation_string":"Hanoi University of science and technology, Hanoi, Vietnam","institution_ids":["https://openalex.org/I94518387"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5051495094","display_name":"Thai-Duong Nguyen","orcid":null},"institutions":[{"id":"https://openalex.org/I94518387","display_name":"Hanoi University of Science and Technology","ror":"https://ror.org/04nyv3z04","country_code":"VN","type":"education","lineage":["https://openalex.org/I94518387"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Thai-Duong Nguyen","raw_affiliation_strings":["Hanoi University of Science and Technology, Hanoi, Vietnam","Hanoi University of science and technology, Hanoi, Vietnam"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Hanoi University of Science and Technology, Hanoi, Vietnam","institution_ids":["https://openalex.org/I94518387"]},{"raw_affiliation_string":"Hanoi University of science and technology, Hanoi, Vietnam","institution_ids":["https://openalex.org/I94518387"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103540278","display_name":"Quang-Dung Pham","orcid":null},"institutions":[{"id":"https://openalex.org/I94518387","display_name":"Hanoi University of Science and Technology","ror":"https://ror.org/04nyv3z04","country_code":"VN","type":"education","lineage":["https://openalex.org/I94518387"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Quang-Dung Pham","raw_affiliation_strings":["Hanoi University of Science and Technology, Hanoi, Vietnam","Hanoi University of science and technology, Hanoi, Vietnam"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Hanoi University of Science and Technology, Hanoi, Vietnam","institution_ids":["https://openalex.org/I94518387"]},{"raw_affiliation_string":"Hanoi University of science and technology, Hanoi, Vietnam","institution_ids":["https://openalex.org/I94518387"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I94518387"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"29","last_page":"29"},"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.9977999925613403,"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.9962000250816345,"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.6671910881996155},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6542242765426636},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.6158974170684814},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5798872113227844},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.570213794708252},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5658988356590271},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4965131878852844},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.47090768814086914},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4638262987136841},{"id":"https://openalex.org/keywords/link","display_name":"Link (geometry)","score":0.45249977707862854},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2651599645614624},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.1331840455532074},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.09356939792633057}],"concepts":[{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6671910881996155},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6542242765426636},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.6158974170684814},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5798872113227844},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.570213794708252},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5658988356590271},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4965131878852844},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.47090768814086914},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4638262987136841},{"id":"https://openalex.org/C2778753846","wikidata":"https://www.wikidata.org/wiki/Q6554239","display_name":"Link (geometry)","level":2,"score":0.45249977707862854},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2651599645614624},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.1331840455532074},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.09356939792633057},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2069216.2069225","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2069216.2069225","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Second Symposium on Information and Communication Technology - SoICT '11","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1548456483","https://openalex.org/W1988144156","https://openalex.org/W1997556033","https://openalex.org/W2019637647","https://openalex.org/W2031486141","https://openalex.org/W2032753014","https://openalex.org/W2131058166","https://openalex.org/W2155061423","https://openalex.org/W2161591474"],"related_works":["https://openalex.org/W4256429076","https://openalex.org/W1971174658","https://openalex.org/W2099195351","https://openalex.org/W2012063272","https://openalex.org/W1518185400","https://openalex.org/W2348092930","https://openalex.org/W3200586296","https://openalex.org/W4230332972","https://openalex.org/W1998033311","https://openalex.org/W4247322236"],"abstract_inverted_index":{"We":[0,91],"consider":[1,86],"here":[2],"a":[3,20,45,57,124],"problem":[4],"of":[5,22,115,128,133,153],"QoS":[6],"routing":[7,89],"in":[8,35,67,76,93],"survivable":[9],"networks":[10],"which":[11,36,71,105],"provides":[12],"protection":[13],"against":[14],"link":[15],"failures.":[16],"In":[17],"this":[18,55,94,116,134,138],"problem,":[19,59],"pair":[21],"link-disjoint":[23],"paths":[24,47],"between":[25],"the":[26,29,39,60,82,109,129,141,151,154],"source":[27],"and":[28,44],"destination":[30],"has":[31],"to":[32,65,74,85],"be":[33],"established":[34],"they":[37],"satisfy":[38],"total":[40],"delay":[41],"path":[42],"constraint":[43],"related":[46],"cost":[48],"is":[49,56,81,106,118],"optimal":[50,130],"(the":[51],"SNOP-D":[52,101],"problem).":[53],"Although":[54],"complex":[58],"NP-hard":[61],"behavior":[62],"seems":[63],"only":[64],"occur":[66,75],"specially":[68],"constructed":[69],"graphs,":[70],"are":[72],"unlikely":[73],"realistic":[77],"communication":[78],"networks.":[79],"That":[80],"main":[83],"reason":[84],"exact":[87],"multi-constrained":[88],"algorithms.":[90],"propose":[92],"paper":[95,117],"an":[96,119],"efficient":[97,120],"exhaustive":[98],"search":[99,143],"algorithm":[100,121],"for":[102,122],"solving":[103],"it":[104],"based":[107],"on":[108,137],"brach-and-bound":[110,142],"technique.":[111,156],"The":[112],"major":[113],"contribution":[114],"finding":[123],"primal":[125,139],"upper":[126],"bound":[127],"objective":[131],"value":[132],"problem.":[135],"Based":[136],"bound,":[140],"can":[144],"then":[145],"perform":[146],"efficiently.":[147],"Simulation":[148],"results":[149],"show":[150],"feasibility":[152],"proposed":[155]},"counts_by_year":[{"year":2018,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}