{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T18:05:52Z","timestamp":1781028352142,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":22,"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-nc-nd\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["CCF-2422926"],"award-info":[{"award-number":["CCF-2422926"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["CCF-2608359"],"award-info":[{"award-number":["CCF-2608359"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,6,9]]},"DOI":"10.1145\/3798129.3800808","type":"proceedings-article","created":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T17:53:56Z","timestamp":1781027636000},"page":"943-954","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Steiner Forest: A Simplified Better-Than-2 Approximation"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5579-3405","authenticated-orcid":false,"given":"Anupam","family":"Gupta","sequence":"first","affiliation":[{"name":"New York University, New York, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9749-2600","authenticated-orcid":false,"given":"Vera","family":"Traub","sequence":"additional","affiliation":[{"name":"ETH Zurich, Zurich, 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.1137\/S0097539792236237"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","unstructured":"Ali Ahmadi Iman Gholami MohammadTaghi Hajiaghayi Peyman Jabbarzade and Mohammad Mahdavi. 2024. Prize-Collecting Steiner Tree: A 1.79 Approximation. In STOC. 1641\u20131652. https:\/\/doi.org\/10.1145\/3618260.3649789 10.1145\/3618260.3649789","DOI":"10.1145\/3618260.3649789"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3722551"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Ali Ahmadi Iman Gholami MohammadTaghi Hajiaghayi Peyman Jabbarzade and Mohammad Mahdavi. 2025. Breaking a Long-Standing Barrier: 2-\u03b5 Approximation for Steiner Forest. In FOCS. CoRR 373\u2013444.","DOI":"10.1109\/FOCS63196.2025.00023"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795281086"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2432622.2432628"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","unstructured":"Jaroslaw Byrka Fabrizio Grandoni and Vera Traub. 2024. The Bidirected Cut Relaxation for Steiner Tree has Integrality Gap Smaller Than 2. In FOCS. 730\u2013753. https:\/\/doi.org\/10.1109\/FOCS61266.2024.00052 10.1109\/FOCS61266.2024.00052","DOI":"10.1109\/FOCS61266.2024.00052"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","unstructured":"Jaroslaw Byrka Fabrizio Grandoni and Vera Traub. 2025. On the Bidirected Cut Relaxation for Steiner Forest. In Integer Programming and Combinatorial Optimization IPCO. 114\u2013127. https:\/\/doi.org\/10.1007\/978-3-031-93112-3_9 10.1007\/978-3-031-93112-3_9","DOI":"10.1007\/978-3-031-93112-3_9"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/J.TCS.2008.06.046"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","unstructured":"Michel X. Goemans Neil Olver Thomas Rothvo\u00df and Rico Zenklusen. 2012. Matroids and integrality gaps for hypergraphic Steiner tree relaxations. In STOC. ACM 1161\u20131176. https:\/\/doi.org\/10.1145\/2213977.2214081 10.1145\/2213977.2214081","DOI":"10.1145\/2213977.2214081"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793242618"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ITCS.2018.31"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","unstructured":"Anupam Gupta and Amit Kumar. 2015. Greedy Algorithms for Steiner Forest. In STOC. 871\u2013878. https:\/\/doi.org\/10.1145\/2746539.2746590 10.1145\/2746539.2746590","DOI":"10.1145\/2746539.2746590"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2003.1238233"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"Mohammad Taghi Hajiaghayi and Kamal Jain. 2006. The prize-collecting generalized Steiner tree problem via a new approach of primal-dual schema. In SODA. 631\u2013640. http:\/\/dl.acm.org\/citation.cfm?id=1109557.1109626","DOI":"10.1145\/1109557.1109626"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s004930170004"},{"key":"e_1_3_2_1_17_1","unstructured":"Jochen K\u00f6nemann Stefano Leonardi and Guido Sch\u00e4fer. 2005. A group-strategyproof mechanism for Steiner forests. In SODA. 612\u2013619."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/050646408"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480101393155"},{"key":"e_1_3_2_1_20_1","volume-title":"Simpler Approximations for the Network Steiner-Tree Problem. Senior Undergraduate Thesis","author":"Srinivas Vaidehi","unstructured":"Vaidehi Srinivas. 2020. Simpler Approximations for the Network Steiner-Tree Problem. Senior Undergraduate Thesis. Carnegie Mellon University"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3722101"},{"key":"e_1_3_2_1_22_1","volume-title":"Better approximation bounds for the network and Euclidean Steiner tree problems","author":"Zelikovsky A.","unstructured":"A. Zelikovsky. 1996. Better approximation bounds for the network and Euclidean Steiner tree problems. University of Virginia. CS-96-06"}],"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.3800808","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3798129.3800808","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T17:56:11Z","timestamp":1781027771000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3798129.3800808"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,9]]},"references-count":22,"alternative-id":["10.1145\/3798129.3800808","10.1145\/3798129"],"URL":"https:\/\/doi.org\/10.1145\/3798129.3800808","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"}}]}}