{"id":"https://openalex.org/W1983740291","doi":"https://doi.org/10.1142/s0129626407002958","title":"SHARED RISK RESOURCE GROUP COMPLEXITY AND APPROXIMABILITY ISSUES","display_name":"SHARED RISK RESOURCE GROUP COMPLEXITY AND APPROXIMABILITY ISSUES","publication_year":2007,"publication_date":"2007-06-01","ids":{"openalex":"https://openalex.org/W1983740291","doi":"https://doi.org/10.1142/s0129626407002958","mag":"1983740291"},"language":"en","primary_location":{"id":"doi:10.1142/s0129626407002958","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129626407002958","pdf_url":null,"source":{"id":"https://openalex.org/S18360026","display_name":"Parallel Processing Letters","issn_l":"0129-6264","issn":["0129-6264","1793-642X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Processing Letters","raw_type":"journal-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/A5020955386","display_name":"David Coudert","orcid":"https://orcid.org/0000-0002-3306-8314"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en informatique et en automatique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1326498283"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"D. COUDERT","raw_affiliation_strings":["MASCOTTE Project, I3S(CNRS/UNSA)/INRIA, 2004 Route Des Lucioles, B.P. 93 \u2013 06902 Sophia-Antipolis Cedex, France"],"affiliations":[{"raw_affiliation_string":"MASCOTTE Project, I3S(CNRS/UNSA)/INRIA, 2004 Route Des Lucioles, B.P. 93 \u2013 06902 Sophia-Antipolis Cedex, France","institution_ids":["https://openalex.org/I1326498283","https://openalex.org/I1294671590"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5046111170","display_name":"Pallab Datta","orcid":"https://orcid.org/0000-0002-7404-4917"},"institutions":[{"id":"https://openalex.org/I1343871089","display_name":"Los Alamos National Laboratory","ror":"https://ror.org/01e41cf67","country_code":"US","type":"facility","lineage":["https://openalex.org/I1330989302","https://openalex.org/I1343871089","https://openalex.org/I198811213","https://openalex.org/I4210120050"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"P. DATTA","raw_affiliation_strings":["Computer and Computational Sciences Division, Los Alamos National Laboratory, Los Alamos, NM 87545, USA"],"affiliations":[{"raw_affiliation_string":"Computer and Computational Sciences Division, Los Alamos National Laboratory, Los Alamos, NM 87545, USA","institution_ids":["https://openalex.org/I1343871089"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5108456351","display_name":"S. P\u00e9rennes","orcid":null},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en informatique et en automatique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1326498283"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"S. PERENNES","raw_affiliation_strings":["MASCOTTE Project, I3S(CNRS/UNSA)/INRIA, 2004 Route Des Lucioles, B.P. 93 \u2013 06902 Sophia-Antipolis Cedex, France"],"affiliations":[{"raw_affiliation_string":"MASCOTTE Project, I3S(CNRS/UNSA)/INRIA, 2004 Route Des Lucioles, B.P. 93 \u2013 06902 Sophia-Antipolis Cedex, France","institution_ids":["https://openalex.org/I1326498283","https://openalex.org/I1294671590"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5086263228","display_name":"Herv\u00e9 Rivano","orcid":"https://orcid.org/0000-0001-6112-7468"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en informatique et en automatique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1326498283"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"H. RIVANO","raw_affiliation_strings":["MASCOTTE Project, I3S(CNRS/UNSA)/INRIA, 2004 Route Des Lucioles, B.P. 93 \u2013 06902 Sophia-Antipolis Cedex, France"],"affiliations":[{"raw_affiliation_string":"MASCOTTE Project, I3S(CNRS/UNSA)/INRIA, 2004 Route Des Lucioles, B.P. 93 \u2013 06902 Sophia-Antipolis Cedex, France","institution_ids":["https://openalex.org/I1326498283","https://openalex.org/I1294671590"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5002779869","display_name":"Marie-\u00c9milie Voge","orcid":"https://orcid.org/0000-0002-1361-9094"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en informatique et en automatique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1326498283"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"M.-E. VOGE","raw_affiliation_strings":["MASCOTTE Project, I3S(CNRS/UNSA)/INRIA, 2004 Route Des Lucioles, B.P. 93 \u2013 06902 Sophia-Antipolis Cedex, France"],"affiliations":[{"raw_affiliation_string":"MASCOTTE Project, I3S(CNRS/UNSA)/INRIA, 2004 Route Des Lucioles, B.P. 93 \u2013 06902 Sophia-Antipolis Cedex, France","institution_ids":["https://openalex.org/I1326498283","https://openalex.org/I1294671590"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5020955386"],"corresponding_institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I1326498283"],"apc_list":null,"apc_paid":null,"fwci":5.2406,"has_fulltext":false,"cited_by_count":80,"citation_normalized_percentile":{"value":0.95408389,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"17","issue":"02","first_page":"169","last_page":"184"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.992900013923645,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.992900013923645,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9764000177383423,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9731000065803528,"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.6687264442443848},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5475803017616272},{"id":"https://openalex.org/keywords/colored","display_name":"Colored","score":0.5142300128936768},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.48564258217811584},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4761495590209961},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4692131578922272},{"id":"https://openalex.org/keywords/survivability","display_name":"Survivability","score":0.4478168487548828},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.44555285573005676},{"id":"https://openalex.org/keywords/group","display_name":"Group (periodic table)","score":0.4341820180416107},{"id":"https://openalex.org/keywords/graph-coloring","display_name":"Graph coloring","score":0.4308730959892273},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.41051995754241943},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.39750736951828003},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.39051511883735657},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3472469747066498},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3339173495769501},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2703959345817566}],"concepts":[{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6687264442443848},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5475803017616272},{"id":"https://openalex.org/C2778307483","wikidata":"https://www.wikidata.org/wiki/Q5149038","display_name":"Colored","level":2,"score":0.5142300128936768},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.48564258217811584},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4761495590209961},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4692131578922272},{"id":"https://openalex.org/C2781133158","wikidata":"https://www.wikidata.org/wiki/Q1088669","display_name":"Survivability","level":2,"score":0.4478168487548828},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.44555285573005676},{"id":"https://openalex.org/C2781311116","wikidata":"https://www.wikidata.org/wiki/Q83306","display_name":"Group (periodic table)","level":2,"score":0.4341820180416107},{"id":"https://openalex.org/C76946457","wikidata":"https://www.wikidata.org/wiki/Q504843","display_name":"Graph coloring","level":3,"score":0.4308730959892273},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.41051995754241943},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39750736951828003},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.39051511883735657},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3472469747066498},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3339173495769501},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2703959345817566},{"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/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C178790620","wikidata":"https://www.wikidata.org/wiki/Q11351","display_name":"Organic chemistry","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129626407002958","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129626407002958","pdf_url":null,"source":{"id":"https://openalex.org/S18360026","display_name":"Parallel Processing Letters","issn_l":"0129-6264","issn":["0129-6264","1793-642X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Processing Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","score":0.41999998688697815,"id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W183244809","https://openalex.org/W189107550","https://openalex.org/W1524993602","https://openalex.org/W1535235745","https://openalex.org/W1557119628","https://openalex.org/W1604902735","https://openalex.org/W1822044859","https://openalex.org/W1941326372","https://openalex.org/W1990313671","https://openalex.org/W1997809628","https://openalex.org/W2011039300","https://openalex.org/W2024505010","https://openalex.org/W2048177396","https://openalex.org/W2070989606","https://openalex.org/W2081254453","https://openalex.org/W2095481180","https://openalex.org/W2100189768","https://openalex.org/W2143235229","https://openalex.org/W2611804663","https://openalex.org/W4210463984","https://openalex.org/W4229945644","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2387494004","https://openalex.org/W2162492390","https://openalex.org/W2350417149","https://openalex.org/W2545190132","https://openalex.org/W2105280038","https://openalex.org/W212597372","https://openalex.org/W2114587117","https://openalex.org/W2127420314","https://openalex.org/W166851098","https://openalex.org/W3103266813"],"abstract_inverted_index":{"This":[0],"article":[1,122],"investigates":[2],"complexity":[3],"and":[4,42,144,148],"approximability":[5,150],"properties":[6],"of":[7,15,40,52,59,69,82,136],"combinatorial":[8],"optimization":[9,89],"problems":[10,71,90,128],"yielded":[11],"by":[12,56],"the":[13,67,79,108,134],"notion":[14],"Shared":[16],"Risk":[17],"Resource":[18],"Group":[19],"(SRRG).":[20],"SRRG":[21],"has":[22,43],"been":[23,44],"introduced":[24],"in":[25,98],"order":[26],"to":[27],"capture":[28],"network":[29],"survivability":[30],"issues":[31],"where":[32,49,126],"a":[33,37,50,57,137,141],"failure":[34],"may":[35],"break":[36],"whole":[38],"set":[39,51,58],"resources,":[41],"formalized":[45],"as":[46,73,107],"colored":[47],"graphs,":[48],"resources":[53],"is":[54],"represented":[55],"edges":[60,135],"with":[61,78],"same":[62],"color.":[63],"We":[64],"consider":[65],"here":[66],"analogous":[68],"classical":[70,99],"such":[72,106],"determining":[74],"paths":[75],"or":[76,84],"cuts":[77],"minimum":[80],"numbers":[81],"colors":[83],"color":[85,139],"disjoint":[86],"paths.":[87],"These":[88],"are":[91,129],"much":[92],"more":[93],"difficult":[94],"than":[95],"their":[96],"counterparts":[97],"graph":[100],"theory.":[101],"In":[102,120],"particular":[103],"standard":[104],"relationship":[105],"Max":[109],"Flow":[110],"-":[111],"Min":[112],"Cut":[113],"equality":[114],"do":[115],"not":[116],"hold":[117],"any":[118],"longer.":[119],"this":[121],"we":[123],"identify":[124],"cases":[125],"these":[127,153],"polynomial,":[130],"for":[131,152],"example":[132],"when":[133],"given":[138],"form":[140],"connected":[142],"subgraph,":[143],"otherwise":[145],"give":[146],"hardness":[147],"non":[149],"results":[151],"problems.":[154]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":8},{"year":2018,"cited_by_count":8},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":7},{"year":2012,"cited_by_count":7}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}