{"id":"https://openalex.org/W4281662460","doi":"https://doi.org/10.1145/3519935.3520035","title":"Breaching the 2-approximation barrier for the forest augmentation problem","display_name":"Breaching the 2-approximation barrier for the forest augmentation problem","publication_year":2022,"publication_date":"2022-06-09","ids":{"openalex":"https://openalex.org/W4281662460","doi":"https://doi.org/10.1145/3519935.3520035"},"language":"en","primary_location":{"id":"doi:10.1145/3519935.3520035","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3519935.3520035","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"conference-paper","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/A5034276567","display_name":"Fabrizio Grandoni","orcid":"https://orcid.org/0000-0002-9676-4931"},"institutions":[{"id":"https://openalex.org/I15196421","display_name":"University of Applied Sciences and Arts of Southern Switzerland","ror":"https://ror.org/05ep8g269","country_code":"CH","type":"education","lineage":["https://openalex.org/I15196421"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Fabrizio Grandoni","raw_affiliation_strings":["USI-SUPSI, Switzerland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"USI-SUPSI, Switzerland","institution_ids":["https://openalex.org/I15196421"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5063520973","display_name":"Afrouz Jabal Ameli","orcid":"https://orcid.org/0000-0001-5620-9039"},"institutions":[{"id":"https://openalex.org/I15196421","display_name":"University of Applied Sciences and Arts of Southern Switzerland","ror":"https://ror.org/05ep8g269","country_code":"CH","type":"education","lineage":["https://openalex.org/I15196421"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Afrouz Jabal Ameli","raw_affiliation_strings":["USI-SUPSI, Switzerland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"USI-SUPSI, Switzerland","institution_ids":["https://openalex.org/I15196421"]}]},{"author_position":"last","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"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ETH Zurich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.2455,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.88178255,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1598","last_page":"1611"},"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.9998999834060669,"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.9998999834060669,"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.9995999932289124,"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.9976999759674072,"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/class","display_name":"Class (philosophy)","score":0.6568547487258911},{"id":"https://openalex.org/keywords/raising","display_name":"Raising (metalworking)","score":0.5820461511611938},{"id":"https://openalex.org/keywords/nothing","display_name":"Nothing","score":0.5750320553779602},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5738920569419861},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5556273460388184},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.388733834028244},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2818393409252167},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.24709907174110413},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.16254988312721252}],"concepts":[{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.6568547487258911},{"id":"https://openalex.org/C2780589192","wikidata":"https://www.wikidata.org/wiki/Q7285140","display_name":"Raising (metalworking)","level":2,"score":0.5820461511611938},{"id":"https://openalex.org/C136815107","wikidata":"https://www.wikidata.org/wiki/Q154242","display_name":"Nothing","level":2,"score":0.5750320553779602},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5738920569419861},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5556273460388184},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.388733834028244},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2818393409252167},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.24709907174110413},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.16254988312721252},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","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},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3519935.3520035","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3519935.3520035","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Life in Land","id":"https://metadata.un.org/sdg/15","score":0.6200000047683716}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1577105815","https://openalex.org/W1976584101","https://openalex.org/W1996608813","https://openalex.org/W1999799345","https://openalex.org/W2052687843","https://openalex.org/W2057915045","https://openalex.org/W2083162966","https://openalex.org/W2092113566","https://openalex.org/W2134875769","https://openalex.org/W2172955861","https://openalex.org/W2287418059","https://openalex.org/W2326678228","https://openalex.org/W2594727037","https://openalex.org/W2777560552","https://openalex.org/W2949889202","https://openalex.org/W2963193695","https://openalex.org/W2979731478","https://openalex.org/W2988480584","https://openalex.org/W3035043943","https://openalex.org/W3105989759","https://openalex.org/W3155451407","https://openalex.org/W3166580633","https://openalex.org/W3177131004","https://openalex.org/W4233583517"],"related_works":["https://openalex.org/W2216420239","https://openalex.org/W3011492772","https://openalex.org/W2499122376","https://openalex.org/W2800570524","https://openalex.org/W2808813869","https://openalex.org/W2109915140","https://openalex.org/W2315519183","https://openalex.org/W2103493327","https://openalex.org/W2349031816","https://openalex.org/W2375097772"],"abstract_inverted_index":{"The":[0],"basic":[1,54],"goal":[2],"of":[3,16,19,24,43],"survivable":[4],"network":[5],"design":[6],"is":[7,49,66],"to":[8],"build":[9],"cheap":[10],"networks":[11],"that":[12],"guarantee":[13],"the":[14,22,58],"connectivity":[15],"certain":[17],"pairs":[18],"nodes":[20],"despite":[21],"failure":[23],"a":[25,37,40],"few":[26],"edges":[27],"or":[28],"nodes.":[29],"A":[30],"celebrated":[31],"result":[32],"by":[33],"Jain":[34],"[Combinatorica'01]":[35],"provides":[36],"2-approximation":[38],"for":[39,52],"wide":[41],"class":[42],"these":[44],"problems.":[45],"However":[46],"nothing":[47],"better":[48],"known":[50],"even":[51],"very":[53],"special":[55],"cases,":[56],"raising":[57],"natural":[59],"question":[60],"whether":[61],"any":[62],"improved":[63],"approximation":[64],"factor":[65],"possible":[67],"at":[68],"all.":[69]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1}],"updated_date":"2026-07-30T17:31:21.811387","created_date":"2025-10-10T00:00:00"}