{"id":"https://openalex.org/W7163983992","doi":"https://doi.org/10.1145/3798129.3800920","title":"A Strong Linear Programming Relaxation for Weighted Tree Augmentation","display_name":"A Strong Linear Programming Relaxation for Weighted Tree Augmentation","publication_year":2026,"publication_date":"2026-06-09","ids":{"openalex":"https://openalex.org/W7163983992","doi":"https://doi.org/10.1145/3798129.3800920"},"language":null,"primary_location":{"id":"doi:10.1145/3798129.3800920","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3798129.3800920","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 58th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1145/3798129.3800920","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5074251728","display_name":"Vincent Cohen-Addad","orcid":"https://orcid.org/0000-0002-0779-8962"},"institutions":[{"id":"https://openalex.org/I1291425158","display_name":"Google (United States)","ror":"https://ror.org/00njsd438","country_code":"US","type":"company","lineage":["https://openalex.org/I1291425158","https://openalex.org/I4210128969"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Vincent Cohen-Addad","raw_affiliation_strings":["Google Research, New York, USA"],"raw_orcid":"https://orcid.org/0000-0002-0779-8962","affiliations":[{"raw_affiliation_string":"Google Research, New York, USA","institution_ids":["https://openalex.org/I1291425158"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5138230869","display_name":"Marina Drygala","orcid":"https://orcid.org/0009-0006-7055-9602"},"institutions":[{"id":"https://openalex.org/I5124864","display_name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","ror":"https://ror.org/02s376052","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I5124864"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Marina Drygala","raw_affiliation_strings":["EPFL, Lausanne, Switzerland"],"raw_orcid":"https://orcid.org/0009-0006-7055-9602","affiliations":[{"raw_affiliation_string":"EPFL, Lausanne, Switzerland","institution_ids":["https://openalex.org/I5124864"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5014157604","display_name":"Nathan Klein","orcid":"https://orcid.org/0009-0003-4052-5864"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nathan Klein","raw_affiliation_strings":["Boston University, Boston, USA"],"raw_orcid":"https://orcid.org/0009-0003-4052-5864","affiliations":[{"raw_affiliation_string":"Boston University, Boston, USA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5046999727","display_name":"Ola Svensson","orcid":"https://orcid.org/0000-0003-2997-1372"},"institutions":[{"id":"https://openalex.org/I5124864","display_name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","ror":"https://ror.org/02s376052","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I5124864"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Ola Svensson","raw_affiliation_strings":["EPFL, Lausanne, Switzerland"],"raw_orcid":"https://orcid.org/0000-0003-2997-1372","affiliations":[{"raw_affiliation_string":"EPFL, Lausanne, Switzerland","institution_ids":["https://openalex.org/I5124864"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.89268637,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"2176","last_page":"2186"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.1907999962568283,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.1907999962568283,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.11479999870061874,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.044199999421834946,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/relaxation","display_name":"Relaxation (psychology)","score":0.4514999985694885},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.42750000953674316},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.35839998722076416},{"id":"https://openalex.org/keywords/current","display_name":"Current (fluid)","score":0.2483000010251999}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5648999810218811},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.4514999985694885},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.42750000953674316},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3808000087738037},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.35839998722076416},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3314000070095062},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.31790000200271606},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2994999885559082},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2833999991416931},{"id":"https://openalex.org/C148043351","wikidata":"https://www.wikidata.org/wiki/Q4456944","display_name":"Current (fluid)","level":2,"score":0.2483000010251999}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3798129.3800920","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3798129.3800920","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 58th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3798129.3800920","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3798129.3800920","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 58th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3897796301","display_name":null,"funder_award_id":"CCF-2442250","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"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":19,"referenced_works":["https://openalex.org/W1577105815","https://openalex.org/W1611628598","https://openalex.org/W1976584101","https://openalex.org/W2002923907","https://openalex.org/W2051699458","https://openalex.org/W2052687843","https://openalex.org/W2057915045","https://openalex.org/W2092113566","https://openalex.org/W2172955861","https://openalex.org/W2287418059","https://openalex.org/W2326678228","https://openalex.org/W2750693896","https://openalex.org/W2777560552","https://openalex.org/W2791470040","https://openalex.org/W2963193695","https://openalex.org/W2963550906","https://openalex.org/W3163298847","https://openalex.org/W4376651388","https://openalex.org/W4408488474"],"related_works":[],"abstract_inverted_index":{"The":[0],"Weighted":[1],"Tree":[2],"Augmentation":[3],"Problem":[4],"(WTAP)":[5],"is":[6,15,34,46,99],"a":[7,18,32,73,85,105],"fundamental":[8],"network":[9],"design":[10],"problem":[11],"where":[12],"the":[13,37,41,78,121],"goal":[14],"to":[16,25,48,124],"find":[17],"minimum-cost":[19],"set":[20],"of":[21,40,64,75,118],"additional":[22],"edges":[23,119],"(links)":[24],"make":[26],"an":[27,92],"input":[28],"tree":[29],"2-edge-connected.":[30],"While":[31],"2-approximation":[33],"standard":[35],"and":[36,66,103,120],"integrality":[38],"gap":[39],"classic":[42],"Cut":[43],"LP":[44],"relaxation":[45,109],"known":[47],"be":[49],"at":[50],"least":[51],"1.5,":[52],"achieving":[53],"approximation":[54,87,93],"factors":[55],"significantly":[56],"below":[57,95],"2":[58],"has":[59],"proven":[60],"challenging.":[61],"Recent":[62],"advances":[63],"Traub":[65],"Zenklusen":[67],"using":[68],"local":[69],"search":[70],"culminated":[71],"in":[72],"ratio":[74,94],"1.5+\u0454,":[76],"establishing":[77],"state-of-the-art.":[79],"In":[80],"this":[81],"work,":[82],"we":[83],"present":[84],"randomized":[86],"algorithm":[88],"for":[89,110],"WTAP":[90,111],"with":[91],"1.49.":[96],"Our":[97],"approach":[98],"based":[100],"on":[101],"designing":[102],"rounding":[104],"strong":[106],"linear":[107],"programming":[108],"which":[112],"incorporates":[113],"variables":[114],"that":[115],"represent":[116],"subsets":[117],"links":[122],"used":[123],"cover":[125],"them,":[126],"inspired":[127],"by":[128],"lift-and-project":[129],"methods":[130],"like":[131],"Sherali-Adams.":[132]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-06-10T00:00:00"}