{"id":"https://openalex.org/W2985577145","doi":"https://doi.org/10.1137/21m1421143","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":2023,"publication_date":"2023-05-23","ids":{"openalex":"https://openalex.org/W2985577145","doi":"https://doi.org/10.1137/21m1421143","mag":"2985577145"},"language":"en","primary_location":{"id":"doi:10.1137/21m1421143","is_oa":false,"landing_page_url":"https://doi.org/10.1137/21m1421143","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://research.tue.nl/en/publications/dbe5e24d-db1b-4a88-8855-55b6a01364c6","any_repository_has_fulltext":true},"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":false,"raw_author_name":"Jaros\u0142aw Byrka","raw_affiliation_strings":["University of Wroc\u0142aw, Wroc\u0142aw, Poland"],"affiliations":[{"raw_affiliation_string":"University of Wroc\u0142aw, 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":[],"countries":[],"is_corresponding":false,"raw_author_name":"Fabrizio Grandoni","raw_affiliation_strings":["IDSIA, USI-SUPSI, Lugano-Viganello, Switzerland"],"affiliations":[{"raw_affiliation_string":"IDSIA, USI-SUPSI, Lugano-Viganello, Switzerland","institution_ids":[]}]},{"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/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Afrouz Jabal Ameli","raw_affiliation_strings":["Eindhoven University of Technology, Eindhoven, Netherlands"],"affiliations":[{"raw_affiliation_string":"Eindhoven University of Technology, Eindhoven, Netherlands","institution_ids":["https://openalex.org/I83019370"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5063520973"],"corresponding_institution_ids":["https://openalex.org/I83019370"],"apc_list":null,"apc_paid":null,"fwci":1.6228,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.85104045,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"52","issue":"3","first_page":"718","last_page":"739"},"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.9998000264167786,"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.9998000264167786,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9980000257492065,"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.9965000152587891,"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/steiner-tree-problem","display_name":"Steiner tree problem","score":0.840961754322052},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.7385144233703613},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.6375393867492676},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.616233766078949},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.49196144938468933},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.46891388297080994},{"id":"https://openalex.org/keywords/hardness-of-approximation","display_name":"Hardness of approximation","score":0.4548918902873993},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.44199100136756897},{"id":"https://openalex.org/keywords/set-cover-problem","display_name":"Set cover problem","score":0.43310391902923584},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4200581908226013},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4125819206237793}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.840961754322052},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.7385144233703613},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.6375393867492676},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.616233766078949},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.49196144938468933},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.46891388297080994},{"id":"https://openalex.org/C112955886","wikidata":"https://www.wikidata.org/wiki/Q5656275","display_name":"Hardness of approximation","level":3,"score":0.4548918902873993},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.44199100136756897},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.43310391902923584},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4200581908226013},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4125819206237793},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/21m1421143","is_oa":false,"landing_page_url":"https://doi.org/10.1137/21m1421143","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:pure.tue.nl:openaire/dbe5e24d-db1b-4a88-8855-55b6a01364c6","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/dbe5e24d-db1b-4a88-8855-55b6a01364c6","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Byrka, J, Grandoni, F & Jabal Ameli, A 2023, 'Breaching the 2-Approximation Barrier for Connectivity Augmentation : A Reduction to Steiner Tree', SIAM Journal on Computing, vol. 52, no. 3, pp. 718-739. https://doi.org/10.1137/21M1421143","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"pmh:oai:pure.tue.nl:openaire/dbe5e24d-db1b-4a88-8855-55b6a01364c6","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/dbe5e24d-db1b-4a88-8855-55b6a01364c6","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Byrka, J, Grandoni, F & Jabal Ameli, A 2023, 'Breaching the 2-Approximation Barrier for Connectivity Augmentation : A Reduction to Steiner Tree', SIAM Journal on Computing, vol. 52, no. 3, pp. 718-739. https://doi.org/10.1137/21M1421143","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G7232049732","display_name":null,"funder_award_id":"2015/18/E/ST6/00456","funder_id":"https://openalex.org/F4320322511","funder_display_name":"Narodowe Centrum Nauki"}],"funders":[{"id":"https://openalex.org/F4320322511","display_name":"Narodowe Centrum Nauki","ror":"https://ror.org/03ha2q922"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":30,"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/W1989224473","https://openalex.org/W1999799345","https://openalex.org/W2002452451","https://openalex.org/W2039298646","https://openalex.org/W2042660957","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/W2571094786","https://openalex.org/W2749954003","https://openalex.org/W2777560552","https://openalex.org/W2963193695","https://openalex.org/W2963428578","https://openalex.org/W2963550906","https://openalex.org/W2979731478","https://openalex.org/W3001902986","https://openalex.org/W3086151071","https://openalex.org/W4232726547","https://openalex.org/W4308178696"],"related_works":["https://openalex.org/W2367195720","https://openalex.org/W1968497507","https://openalex.org/W2950850544","https://openalex.org/W1998126097","https://openalex.org/W1980288485","https://openalex.org/W2009976792","https://openalex.org/W2004321562","https://openalex.org/W3184075718","https://openalex.org/W2073435288","https://openalex.org/W2952838392"],"abstract_inverted_index":{"The":[0,29,93],"basic":[1,40],"goal":[2],"of":[3,20,25,37,53,63,198,287,395,398],"survivable":[4,414],"network":[5,12,84,415],"design":[6,416],"is":[7,34,102,116,132,345,420],"to":[8,69,75,80,158,176,194,322,377,425],"build":[9],"a":[10,26,46,51,58,228,271,284,320,357,369,399],"cheap":[11],"that":[13,66,153],"maintains":[14],"the":[15,23,38,159,167,177,185,195,249,260,299,323,351,383,388,392,396,429],"connectivity":[16,30,74],"between":[17,410],"given":[18,45],"sets":[19],"nodes":[21],"despite":[22],"failure":[24],"few":[27],"edges/nodes.":[28],"augmentation":[31,169,187],"problem":[32,101,170,188,326],"(CAP)":[33],"arguably":[35],"one":[36,78],"most":[39],"problems":[41,419],"in":[42,117,145,331,428],"this":[43,99,105,199,256,408],"area:":[44],"k(-edge)-connected":[47],"graph":[48],"G":[49,70],"and":[50,104,121,140,175,205,236,349,390,417,422],"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,269],"augmenting":[88],"it":[89],"with":[90,109,227],"edges.":[92],"best":[94,250,353],"known":[95,133,165,183,223,251],"approximation":[96,220,231,252,262,301,347,354,411],"factor":[97,355],"for":[98,172,190,224,247,264,267,303,356,413],"NP-hard":[100],"2,":[103,181],"can":[106,155],"be":[107,156,374],"achieved":[108],"multiple":[110],"approaches":[111],"(the":[112],"first":[113],"result":[115],"[G.":[118],"N.":[119],"Frederickson":[120],"J\\'aj\\'":[122],"a,":[123],"SIAM":[124],"J.":[125,363],"Comput.,":[126],"10":[127],"(1981),":[128],"pp.":[129,151,214,244,341],"270-283].":[130],"It":[131],"[E.":[134],"A.":[135,137,206],"Dinitz,":[136],"V.":[138,142],"Karzanov,":[139],"M.":[141],"Lomonosov,":[143],"Studies":[144],"Discrete":[146],"Optimization,":[147],"Nauka,":[148],"Moscow,":[149],"1976,":[150],"290-306]":[152],"CAP":[154],"reduced":[157],"case":[160,178],"k":[161,179],"=":[162,180],"1,":[163],"also":[164,182],"as":[166,184,368],"tree":[168,325,359,401],"(TAP)":[171],"odd":[173],"k,":[174],"cactus":[186],"(CacAP)":[189],"even":[191],"k.":[192],"Prior":[193],"conference":[196],"version":[197],"paper":[200,257],"[J.":[201],"Byrka,":[202],"F.":[203],"Grandoni,":[204,233],"Jabal":[207],"Ameli,":[208],"STOC'20,":[209],"ACM,":[210,240,364],"New":[211,241],"York,":[212,242],"2020,":[213],"815-825],":[215],"several":[216],"better":[217],"than":[218],"2":[219,261,273],"algorithms":[221,302,308,333,412],"were":[222],"TAP,":[225],"culminating":[226],"recent":[229],"1.458":[230],"[F.":[232],"C.":[234],"Kalaitzis,":[235],"R.":[237],"Zenklusen,":[238],"STOC'18,":[239],"1918,":[243],"632-645].":[245],"However,":[246],"CacAP":[248],"was":[253,328],"2.":[254,380],"In":[255,297,405],"we":[258,386],"breach":[259],"barrier":[263],"CacAP,":[265],"hence,":[266],"CAP,":[268],"presenting":[270],"polynomial-time":[272],"ln(4)":[274],"-":[275],"<sub>1120</sub>":[276],"<sup>967</sup>":[277],"+":[278],"\\varepsilon":[279],"&lt;":[280],"1.91":[281],"approximation.":[282],"From":[283],"technical":[285],"point":[286],"view,":[288],"our":[289,406],"approach":[290],"deviates":[291],"quite":[292],"substantially":[293],"from":[294,403],"previous":[295],"work.":[296],"particular,":[298],"better-than-2":[300],"TAP":[304],"either":[305],"exploit":[306,391],"greedy-style":[307],"or":[309],"are":[310],"based":[311],"on":[312,379],"rounding":[313],"carefully":[314],"designed":[315],"LPs.":[316],"We":[317],"instead":[318],"use":[319],"reduction":[321,344],"Steiner":[324,358,400],"which":[327],"previously":[329],"used":[330],"parameterized":[332],"[Basavaraju":[334],"et":[335,361],"al.,":[336,362],"ICALP'14,":[337],"Springer,":[338],"Berlin,":[339],"2014,":[340],"800-811].":[342],"This":[343],"not":[346,373],"preserving,":[348],"using":[350],"current":[352],"[Byrka":[360],"60":[365],"(2013),":[366],"6]":[367],"black":[370],"box":[371],"would":[372],"good":[375],"enough":[376],"improve":[378],"To":[381],"achieve":[382],"latter":[384],"goal,":[385],"``open":[387],"box\"\"":[389],"specific":[393],"properties":[394],"instances":[397],"arising":[402],"CacAP.":[404],"opinion":[407],"connection":[409],"Steiner-type":[418],"interesting,":[421],"might":[423],"lead":[424],"other":[426],"results":[427],"area.":[430]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":1}],"updated_date":"2026-03-09T08:58:05.943551","created_date":"2025-10-10T00:00:00"}