{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T18:05:48Z","timestamp":1781028348951,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T00:00:00Z","timestamp":1780963200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-2442250"],"award-info":[{"award-number":["CCF-2442250"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Swiss State Secretariat for Education, Research and Innovation (SERI)","award":["MB22.00054"],"award-info":[{"award-number":["MB22.00054"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,6,9]]},"DOI":"10.1145\/3798129.3800920","type":"proceedings-article","created":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T17:53:56Z","timestamp":1781027636000},"page":"2176-2186","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["A Strong Linear Programming Relaxation for Weighted Tree Augmentation"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0779-8962","authenticated-orcid":false,"given":"Vincent","family":"Cohen-Addad","sequence":"first","affiliation":[{"name":"Google Research, New York, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-7055-9602","authenticated-orcid":false,"given":"Marina","family":"Drygala","sequence":"additional","affiliation":[{"name":"EPFL, Lausanne, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-4052-5864","authenticated-orcid":false,"given":"Nathan","family":"Klein","sequence":"additional","affiliation":[{"name":"Boston University, Boston, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2997-1372","authenticated-orcid":false,"given":"Ola","family":"Svensson","sequence":"additional","affiliation":[{"name":"EPFL, Lausanne, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,6,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3182395"},{"key":"e_1_3_2_1_2_1","volume-title":"Proceedings of 52nd ACM Symposium on Theory of Computing (STOC).","author":"Byrka J.","unstructured":"J. Byrka, F. Grandoni, and A. Jabal Ameli. 2020. Breaching the 2-Approximation Barrier for Connectivity Augmentation: a Reduction to Steiner Tree. In Proceedings of 52nd ACM Symposium on Theory of Computing (STOC)."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2432622.2432628"},{"key":"e_1_3_2_1_4_1","volume-title":"Proceedings of 53rd Annual ACM Symposium on Theory of Computing (STOC). arxiv:2012","author":"Cecchetto F.","year":"2012","unstructured":"F. Cecchetto, V. Traub, and R. Zenklusen. 2021. Bridging the Gap Between Tree and Connectivity Augmentation: Unified and Stronger Approaches. In Proceedings of 53rd Annual ACM Symposium on Theory of Computing (STOC). arxiv:2012.00086 To appear. See also arXiv:2012.00086."},{"key":"e_1_3_2_1_5_1","first-page":"530","article-title":"Approximating (Unweighted) Tree Augmentation via Lift-and-Project","volume":"80","author":"Cheriyan J.","year":"2018","unstructured":"J. Cheriyan and Z. Gao. 2018. Approximating (Unweighted) Tree Augmentation via Lift-and-Project, Part I: Stemless TAP. Algorithmica, 80 (2018), 530\u2013559.","journal-title":"Part I: Stemless TAP. Algorithmica"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-017-0275-7"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2008.01.009"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2013.04.004"},{"key":"e_1_3_2_1_9_1","unstructured":"Vincent Cohen-Addad Marina Drygala Nathan Klein and Ola Svensson. 2026. A Strong Linear Programming Relaxation for Weighted Tree Augmentation. arxiv:2603.29582. arxiv:2603.29582"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1497290.1497297"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"S. Fiorini M. Gross J. K\u00f6nemann and L. Sanit\u00e0. 2018. Approximating Weighted Tree Augmentation via Chv\u00e1tal-Gomory Cuts. In SODA. 817\u2013831.","DOI":"10.1137\/1.9781611975031.53"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/0210019"},{"key":"e_1_3_2_1_13_1","volume-title":"Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 223\u2013232","author":"Goemans M. X.","unstructured":"M. X. Goemans, A. V. Goldberg, S. Plotkin, D. B. Shmoys, \u00c9. Tardos, and D. P. Williamson. 1994. Improved Approximation Algorithms for Network Design Problems. In Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 223\u2013232."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188898"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s004930170004"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"S. Khuller and R. Thurimella. 1992. Approximation algorithms for graph augmentation. In Automata Languages and Programming W. Kuich (Ed.). Springer Berlin Heidelberg Berlin Heidelberg. 330\u2013341. isbn:978-3-540-47278-0","DOI":"10.1007\/3-540-55719-9_85"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/174652.174654"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702416736"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2786981"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2017.12.033"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(02)00218-4"},{"key":"e_1_3_2_1_22_1","volume-title":"Proceedings of 25th Annual Symposium on Algorithms (ESA). 61:1\u201361:14","author":"Nutov Z.","year":"2017","unstructured":"Z. Nutov. 2017. On the Tree Augmentation Problem. In Proceedings of 25th Annual Symposium on Algorithms (ESA). 61:1\u201361:14."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"Z. Nutov. 2020. Approximation Algorithms for Connectivity Augmentation Problems. arXiv preprint arXiv:2009.13257. arxiv:2009.13257","DOI":"10.1007\/978-3-642-03685-9_22"},{"key":"e_1_3_2_1_24_1","volume-title":"2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS). 1\u201312","author":"Traub V.","unstructured":"V. Traub and R. Zenklusen. 2022. A better-than-2 approximation for weighted tree augmentation. In 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS). 1\u201312."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3564246.3585122"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","unstructured":"Vera Traub and Rico Zenklusen. 2025. Better-Than-2 Approximations for Weighted Tree Augmentation and Applications to Steiner Tree. J. ACM March issn:0004-5411 https:\/\/doi.org\/10.1145\/3722101 Just Accepted. 10.1145\/3722101","DOI":"10.1145\/3722101"}],"event":{"name":"STOC '26: 58th Annual ACM Symposium on Theory of Computing","location":"Salt Lake City UT USA","acronym":"STOC '26","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 58th Annual ACM Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3798129.3800920","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3798129.3800920","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T17:55:23Z","timestamp":1781027723000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3798129.3800920"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,9]]},"references-count":26,"alternative-id":["10.1145\/3798129.3800920","10.1145\/3798129"],"URL":"https:\/\/doi.org\/10.1145\/3798129.3800920","relation":{},"subject":[],"published":{"date-parts":[[2026,6,9]]},"assertion":[{"value":"2026-06-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}