{"id":"https://openalex.org/W3035043943","doi":"https://doi.org/10.1145/3357713.3384301","title":"Breaching the 2-approximation barrier for connectivity augmentation: a reduction to Steiner tree","display_name":"Breaching the 2-approximation barrier for connectivity augmentation: a reduction to Steiner tree","publication_year":2020,"publication_date":"2020-06-07","ids":{"openalex":"https://openalex.org/W3035043943","doi":"https://doi.org/10.1145/3357713.3384301","mag":"3035043943"},"language":"en","primary_location":{"id":"doi:10.1145/3357713.3384301","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3357713.3384301","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing","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/A5023591555","display_name":"Jaros\u0142aw Byrka","orcid":"https://orcid.org/0000-0002-3387-0913"},"institutions":[{"id":"https://openalex.org/I219388962","display_name":"University of Wroc\u0142aw","ror":"https://ror.org/00yae6e25","country_code":"PL","type":"education","lineage":["https://openalex.org/I219388962"]}],"countries":["PL"],"is_corresponding":true,"raw_author_name":"Jaros\u0142aw Byrka","raw_affiliation_strings":["University of Wroc\u0142aw, Poland"],"affiliations":[{"raw_affiliation_string":"University of Wroc\u0142aw, Poland","institution_ids":["https://openalex.org/I219388962"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5034276567","display_name":"Fabrizio Grandoni","orcid":"https://orcid.org/0000-0002-9676-4931"},"institutions":[{"id":"https://openalex.org/I2614128279","display_name":"Dalle Molle Institute for Artificial Intelligence Research","ror":"https://ror.org/013355g38","country_code":"CH","type":"facility","lineage":["https://openalex.org/I15196421","https://openalex.org/I2614128279","https://openalex.org/I57201433"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Fabrizio Grandoni","raw_affiliation_strings":["IDSIA, Switzerland"],"affiliations":[{"raw_affiliation_string":"IDSIA, Switzerland","institution_ids":["https://openalex.org/I2614128279"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5063520973","display_name":"Afrouz Jabal Ameli","orcid":"https://orcid.org/0000-0001-5620-9039"},"institutions":[{"id":"https://openalex.org/I2614128279","display_name":"Dalle Molle Institute for Artificial Intelligence Research","ror":"https://ror.org/013355g38","country_code":"CH","type":"facility","lineage":["https://openalex.org/I15196421","https://openalex.org/I2614128279","https://openalex.org/I57201433"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Afrouz Jabal Ameli","raw_affiliation_strings":["IDSIA, Switzerland"],"affiliations":[{"raw_affiliation_string":"IDSIA, Switzerland","institution_ids":["https://openalex.org/I2614128279"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5023591555"],"corresponding_institution_ids":["https://openalex.org/I219388962"],"apc_list":null,"apc_paid":null,"fwci":2.3922,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.91132886,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"815","last_page":"825"},"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.9994999766349792,"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.9994999766349792,"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.9986000061035156,"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/T10083","display_name":"Graphene research and applications","score":0.9962999820709229,"subfield":{"id":"https://openalex.org/subfields/2505","display_name":"Materials Chemistry"},"field":{"id":"https://openalex.org/fields/25","display_name":"Materials Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.8950004577636719},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.6742017269134521},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5558785796165466},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5508933663368225},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.5397248268127441},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5134514570236206},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.4908011853694916},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.43903648853302},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4301333427429199},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4172830879688263},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.39096102118492126}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.8950004577636719},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.6742017269134521},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5558785796165466},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5508933663368225},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.5397248268127441},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5134514570236206},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.4908011853694916},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.43903648853302},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4301333427429199},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4172830879688263},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39096102118492126},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"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/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/3357713.3384301","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3357713.3384301","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing","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":26,"referenced_works":["https://openalex.org/W69311884","https://openalex.org/W359386717","https://openalex.org/W1548400851","https://openalex.org/W1577105815","https://openalex.org/W1963899113","https://openalex.org/W1976584101","https://openalex.org/W1999799345","https://openalex.org/W2002452451","https://openalex.org/W2039298646","https://openalex.org/W2051699458","https://openalex.org/W2057915045","https://openalex.org/W2083162966","https://openalex.org/W2134875769","https://openalex.org/W2172955861","https://openalex.org/W2287418059","https://openalex.org/W2326678228","https://openalex.org/W2541541317","https://openalex.org/W2594727037","https://openalex.org/W2777560552","https://openalex.org/W2914828086","https://openalex.org/W2963193695","https://openalex.org/W2963428578","https://openalex.org/W2963550906","https://openalex.org/W2979731478","https://openalex.org/W3001902986","https://openalex.org/W4233583517"],"related_works":["https://openalex.org/W2367195720","https://openalex.org/W1968497507","https://openalex.org/W1998126097","https://openalex.org/W1980288485","https://openalex.org/W2009976792","https://openalex.org/W3184075718","https://openalex.org/W2995411114","https://openalex.org/W2004321562","https://openalex.org/W328736688","https://openalex.org/W2404561224"],"abstract_inverted_index":{"The":[0,29,93],"basic":[1,40],"goal":[2],"of":[3,20,25,37,53,63],"survivable":[4],"network":[5,12,84],"design":[6],"is":[7,34,102,116],"to":[8,69,75,80],"build":[9],"a":[10,26,46,51,58],"cheap":[11],"that":[13,66],"maintains":[14],"the":[15,23,38],"connectivity":[16,74],"between":[17],"given":[18,45],"sets":[19],"nodes":[21],"despite":[22],"failure":[24],"few":[27],"edges/nodes.":[28],"Connectivity":[30],"Augmentation":[31],"Problem":[32],"(CAP)":[33],"arguably":[35],"one":[36,78],"most":[39],"problems":[41],"in":[42,117],"this":[43,99,105],"area:":[44],"k(-edge)-connected":[47],"graph":[48],"G":[49,70],"and":[50,104,119],"set":[52],"extra":[54,91],"edges":[55],"(links),":[56],"select":[57],"minimum":[59],"cardinality":[60],"subset":[61],"A":[62,68],"links":[64],"such":[65,114],"adding":[67],"increases":[71],"its":[72],"edge":[73],"k+1.":[76],"Intuitively,":[77],"wants":[79],"make":[81],"an":[82],"existing":[83],"more":[85],"reliable":[86],"by":[87],"augmenting":[88],"it":[89],"with":[90,109],"edges.":[92],"best":[94],"known":[95],"approximation":[96],"factor":[97],"for":[98],"NP-hard":[100],"problem":[101],"2,":[103],"can":[106],"be":[107],"achieved":[108],"multiple":[110],"approaches":[111],"(the":[112],"first":[113],"result":[115],"[Frederickson":[118],"J\u00e1j\u00e1\u201981]).":[120]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}