{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,23]],"date-time":"2026-07-23T03:37:55Z","timestamp":1784777875442,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,6,9]],"date-time":"2022-06-09T00:00:00Z","timestamp":1654732800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,6,9]]},"DOI":"10.1145\/3519935.3520035","type":"proceedings-article","created":{"date-parts":[[2022,6,10]],"date-time":"2022-06-10T15:29:32Z","timestamp":1654874972000},"page":"1598-1611","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Breaching the 2-approximation barrier for the forest augmentation problem"],"prefix":"10.1145","author":[{"given":"Fabrizio","family":"Grandoni","sequence":"first","affiliation":[{"name":"USI-SUPSI, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Afrouz Jabal","family":"Ameli","sequence":"additional","affiliation":[{"name":"USI-SUPSI, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vera","family":"Traub","sequence":"additional","affiliation":[{"name":"ETH Zurich, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2022,6,10]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974782.157"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384301"},{"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","doi-asserted-by":"publisher","DOI":"10.1145\/3406325.3451086"},{"key":"e_1_3_2_1_5_1","volume-title":"An Improved Approximation Algorithm for the Matching Augmentation Problem. CoRR, abs\/2007.11559","author":"Cheriyan Joseph","year":"2020","unstructured":"Joseph Cheriyan , Robert Cummings , Jack Dippel , and Jasper Zhu . 2020. An Improved Approximation Algorithm for the Matching Augmentation Problem. CoRR, abs\/2007.11559 ( 2020 ), arxiv:2007.11559. arxiv:2007.11559 Joseph Cheriyan, Robert Cummings, Jack Dippel, and Jasper Zhu. 2020. An Improved Approximation Algorithm for the Matching Augmentation Problem. CoRR, abs\/2007.11559 (2020), arxiv:2007.11559. arxiv:2007.11559"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-019-01394-z"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480199362071"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/S009753979833920X"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2013.04.004"},{"key":"e_1_3_2_1_10_1","volume-title":"Lomonosov","author":"Dinits Evim A.","year":"1976","unstructured":"Evim A. Dinits , Alexander V. Karzanov , and Michael V . Lomonosov . 1976 . On the structure of a family of minimal weighted cuts in a graph. Studies in Discrete Optimization , 290\u2013306. Evim A. Dinits, Alexander V. Karzanov, and Michael V. Lomonosov. 1976. On the structure of a family of minimal weighted cuts in a graph. Studies in Discrete Optimization, 290\u2013306."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1497290.1497297"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975031.53"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/080732572"},{"key":"e_1_3_2_1_14_1","volume-title":"On the Cycle Augmentation Problem: Hardness and Approximation Algorithms. In Workshop on Approximation and Online Algorithms (WAOA).","author":"Galvez Waldo","year":"2019","unstructured":"Waldo Galvez , Fabrizio Grandoni , Afrouz Jabal Ameli , and Krzysztof Sornat . 2019 . On the Cycle Augmentation Problem: Hardness and Approximation Algorithms. In Workshop on Approximation and Online Algorithms (WAOA). Waldo Galvez, Fabrizio Grandoni, Afrouz Jabal Ameli, and Krzysztof Sornat. 2019. On the Cycle Augmentation Problem: Hardness and Approximation Algorithms. In Workshop on Approximation and Online Algorithms (WAOA)."},{"key":"e_1_3_2_1_15_1","volume-title":"Afrouz Jabal Ameli, and Vera Traub","author":"Grandoni Fabrizio","year":"2021","unstructured":"Fabrizio Grandoni , Afrouz Jabal Ameli, and Vera Traub . 2021 . Breaching the 2-Approximation Barrier for the Forest Augmentation Problem . arXiv preprint arXiv:2112.11799. Fabrizio Grandoni, Afrouz Jabal Ameli, and Vera Traub. 2021. Breaching the 2-Approximation Barrier for the Forest Augmentation Problem. arXiv preprint arXiv:2112.11799."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188898"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3341599"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/s004930170004"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/174652.174654"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702416736"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2786981"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(02)00218-4"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ESA.2017.61"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-79416-3_19"},{"key":"e_1_3_2_1_25_1","volume-title":"Combinatorial Optimization, Polyhedra and Efficiency","author":"Schrijver Alexander","unstructured":"Alexander Schrijver . 2003. Combinatorial Optimization, Polyhedra and Efficiency . Springer . isbn:978-3-540-44389-6 Alexander Schrijver. 2003. Combinatorial Optimization, Polyhedra and Efficiency. Springer. isbn:978-3-540-44389-6"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-014-2960-3"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS52979.2021.00010"},{"key":"e_1_3_2_1_28_1","volume-title":"Local Search for Weighted Tree Augmentation and Steiner Tree. In ACM-SIAM Symposium on Discrete Algorithms (SODA). 3253\u20133272","author":"Traub Vera","year":"2022","unstructured":"Vera Traub and Rico Zenklusen . 2022 . Local Search for Weighted Tree Augmentation and Steiner Tree. In ACM-SIAM Symposium on Discrete Algorithms (SODA). 3253\u20133272 . Vera Traub and Rico Zenklusen. 2022. Local Search for Weighted Tree Augmentation and Steiner Tree. In ACM-SIAM Symposium on Discrete Algorithms (SODA). 3253\u20133272."}],"event":{"name":"STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing","location":"Rome Italy","acronym":"STOC '22","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3519935.3520035","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3519935.3520035","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:31:15Z","timestamp":1750188675000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3519935.3520035"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,9]]},"references-count":28,"alternative-id":["10.1145\/3519935.3520035","10.1145\/3519935"],"URL":"https:\/\/doi.org\/10.1145\/3519935.3520035","relation":{},"subject":[],"published":{"date-parts":[[2022,6,9]]},"assertion":[{"value":"2022-06-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}