{"id":"https://openalex.org/W3166580633","doi":"https://doi.org/10.1145/3406325.3451086","title":"Bridging the gap between tree and connectivity augmentation: unified and stronger approaches","display_name":"Bridging the gap between tree and connectivity augmentation: unified and stronger approaches","publication_year":2021,"publication_date":"2021-06-15","ids":{"openalex":"https://openalex.org/W3166580633","doi":"https://doi.org/10.1145/3406325.3451086","mag":"3166580633"},"language":"en","primary_location":{"id":"doi:10.1145/3406325.3451086","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3406325.3451086","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 53rd 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/A5062226848","display_name":"Federica Cecchetto","orcid":null},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":true,"raw_author_name":"Federica Cecchetto","raw_affiliation_strings":["ETH Zurich, Switzerland"],"affiliations":[{"raw_affiliation_string":"ETH Zurich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5065421870","display_name":"Vera Traub","orcid":"https://orcid.org/0000-0001-9749-2600"},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Vera Traub","raw_affiliation_strings":["ETH Zurich, Switzerland"],"affiliations":[{"raw_affiliation_string":"ETH Zurich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5033406324","display_name":"Rico Zenklusen","orcid":"https://orcid.org/0000-0002-7148-9304"},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Rico Zenklusen","raw_affiliation_strings":["ETH Zurich, Switzerland"],"affiliations":[{"raw_affiliation_string":"ETH Zurich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5062226848"],"corresponding_institution_ids":["https://openalex.org/I35440088"],"apc_list":null,"apc_paid":null,"fwci":2.6635,"has_fulltext":false,"cited_by_count":22,"citation_normalized_percentile":{"value":0.91131193,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":95,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"370","last_page":"383"},"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.9991999864578247,"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.9991999864578247,"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/T10083","display_name":"Graphene research and applications","score":0.9988999962806702,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9894999861717224,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6092971563339233},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5576575994491577},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.5550562739372253},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.5358542203903198},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.531790018081665},{"id":"https://openalex.org/keywords/bridging","display_name":"Bridging (networking)","score":0.5144374966621399},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.5040399432182312},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.49374064803123474},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.4469645023345947},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4325668215751648},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.43163707852363586},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.4117082953453064},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.37894129753112793},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3605906367301941},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3243411183357239},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.30319055914878845},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.08330821990966797},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.07153674960136414}],"concepts":[{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6092971563339233},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5576575994491577},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.5550562739372253},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.5358542203903198},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.531790018081665},{"id":"https://openalex.org/C174348530","wikidata":"https://www.wikidata.org/wiki/Q188635","display_name":"Bridging (networking)","level":2,"score":0.5144374966621399},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.5040399432182312},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.49374064803123474},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.4469645023345947},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4325668215751648},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.43163707852363586},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.4117082953453064},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37894129753112793},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3605906367301941},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3243411183357239},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30319055914878845},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.08330821990966797},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.07153674960136414},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3406325.3451086","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3406325.3451086","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G7803272888","display_name":null,"funder_award_id":"817750","funder_id":"https://openalex.org/F4320334678","funder_display_name":"European Research Council"},{"id":"https://openalex.org/G83575632","display_name":null,"funder_award_id":"200021_184622","funder_id":"https://openalex.org/F4320320924","funder_display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung"}],"funders":[{"id":"https://openalex.org/F4320320924","display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung","ror":"https://ror.org/00yjd3n13"},{"id":"https://openalex.org/F4320334678","display_name":"European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W359386717","https://openalex.org/W1548400851","https://openalex.org/W1577105815","https://openalex.org/W1976584101","https://openalex.org/W1999799345","https://openalex.org/W2001139415","https://openalex.org/W2002452451","https://openalex.org/W2002923907","https://openalex.org/W2051699458","https://openalex.org/W2057915045","https://openalex.org/W2092113566","https://openalex.org/W2122195804","https://openalex.org/W2172955861","https://openalex.org/W2287418059","https://openalex.org/W2326678228","https://openalex.org/W2552451242","https://openalex.org/W2777560552","https://openalex.org/W2791470040","https://openalex.org/W2963193695","https://openalex.org/W2963428578","https://openalex.org/W2963550906","https://openalex.org/W2979731478","https://openalex.org/W3001902986","https://openalex.org/W3035043943","https://openalex.org/W3044596390","https://openalex.org/W3163298847","https://openalex.org/W3166580633","https://openalex.org/W4205585032","https://openalex.org/W4230982766","https://openalex.org/W4239237828","https://openalex.org/W4293860921","https://openalex.org/W6903114607","https://openalex.org/W6921936889"],"related_works":["https://openalex.org/W2099915933","https://openalex.org/W2418231958","https://openalex.org/W4380840098","https://openalex.org/W3116169590","https://openalex.org/W2044443696","https://openalex.org/W1703428550","https://openalex.org/W2503538928","https://openalex.org/W3101281637","https://openalex.org/W2390742649","https://openalex.org/W1561849181"],"abstract_inverted_index":{"We":[0],"consider":[1],"the":[2,11,21,30,47,64,71,78,132],"Connectivity":[3],"Augmentation":[4,80],"Problem":[5,81],"(CAP),":[6],"a":[7,24,37,42,52,85,142,147],"classical":[8],"problem":[9,72],"in":[10,29],"area":[12],"of":[13,23,44,56],"Survivable":[14],"Network":[15],"Design.":[16],"It":[17],"is":[18,49,69,73,84,105,150],"about":[19],"increasing":[20],"edge-connectivity":[22],"graph":[25,39,65],"by":[26,140],"one":[27],"unit":[28],"cheapest":[31],"possible":[32],"way.":[33],"More":[34],"precisely,":[35],"given":[36],"k-edge-connected":[38],"G=(V,E)":[40],"and":[41,125],"set":[43],"extra":[45,57],"edges,":[46],"task":[48],"to":[50,61,75,77,96,115,130],"find":[51],"minimum":[53],"cardinality":[54],"subset":[55],"edges":[58],"whose":[59],"addition":[60],"G":[62,83],"makes":[63],"(k+1)-edge-connected.":[66],"If":[67],"k":[68],"odd,":[70],"known":[74],"reduce":[76],"Tree":[79],"(TAP)\u2014i.e.,":[82],"spanning":[86],"tree\u2014for":[87],"which":[88],"significant":[89],"progress":[90],"has":[91],"been":[92],"achieved":[93],"recently,":[94,122],"leading":[95],"approximation":[97,134],"factors":[98],"below":[99,136],"1.5":[100],"(the":[101],"currently":[102],"best":[103],"factor":[104,135],"1.458).":[106],"However,":[107],"advances":[108,154],"on":[109,146],"TAP":[110],"did":[111],"not":[112],"carry":[113],"over":[114],"CAP":[116,139],"so":[117],"far.":[118],"Indeed,":[119],"only":[120],"very":[121],"Byrka,":[123],"Grandoni,":[124],"Ameli":[126],"(STOC":[127],"2020)":[128],"managed":[129],"obtain":[131],"first":[133],"2":[137],"for":[138,155],"presenting":[141],"1.91-approximation":[143],"algorithm":[144],"based":[145],"method":[148],"that":[149],"disjoint":[151],"from":[152],"recent":[153],"TAP.":[156]},"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":6},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}