{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:30:14Z","timestamp":1750307414674,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,6,5]],"date-time":"2010-06-05T00:00:00Z","timestamp":1275696000000},"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":[[2010,6,5]]},"DOI":"10.1145\/1806689.1806720","type":"proceedings-article","created":{"date-parts":[[2010,6,8]],"date-time":"2010-06-08T12:37:34Z","timestamp":1276000654000},"page":"211-220","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["Approximation schemes for steiner forest on planar graphs and graphs of bounded treewidth"],"prefix":"10.1145","author":[{"given":"MohammadHossein","family":"Bateni","sequence":"first","affiliation":[{"name":"Princeton University, Princeton, NJ, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"MohammadTaghi","family":"Hajiaghayi","sequence":"additional","affiliation":[{"name":"AT&T Labs -- Research, Florham Park, NJ, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D\u00e1niel","family":"Marx","sequence":"additional","affiliation":[{"name":"Tel Aviv University, Tel Aviv, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2010,6,5]]},"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","DOI":"10.1145\/103418.103437"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2009.39"},{"key":"e_1_3_2_1_4_1","volume-title":"FOCS, page 2","author":"Arora S.","year":"1996","unstructured":"S. Arora . Polynomial time approximation schemes for Euclidean TSP and other geometric problems . In FOCS, page 2 , 1996 . S. Arora. Polynomial time approximation schemes for Euclidean TSP and other geometric problems. In FOCS, page 2, 1996."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/290179.290180"},{"key":"e_1_3_2_1_6_1","volume-title":"Approximation schemes for Steiner forest on planar graphs and graphs of bounded treewidth. CoRR, abs\/0911.5143","author":"Bateni M.","year":"2009","unstructured":"M. Bateni , M. Hajiaghayi , and D. Marx . Approximation schemes for Steiner forest on planar graphs and graphs of bounded treewidth. CoRR, abs\/0911.5143 , 2009 . M. Bateni, M. Hajiaghayi, and D. Marx. Approximation schemes for Steiner forest on planar graphs and graphs of bounded treewidth. CoRR, abs\/0911.5143, 2009."},{"key":"e_1_3_2_1_7_1","first-page":"325","volume-title":"SODA","author":"Berman P.","year":"1992","unstructured":"P. Berman and V. Ramaiyer . Improved approximations for the Steiner tree problem . In SODA , pages 325 -- 334 , 1992 . P. Berman and V. Ramaiyer. Improved approximations for the Steiner tree problem. In SODA, pages 325--334, 1992."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(89)90039-2"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(97)00228-4"},{"key":"e_1_3_2_1_10_1","first-page":"171","volume-title":"STACS","author":"Borradaile G.","year":"2009","unstructured":"G. Borradaile , E. D. Demaine , and S. Tazari . Polynomial-time approximation schemes for subset-connectivity problems in bounded genus graphs . In STACS , pages 171 -- 182 , 2009 . G. Borradaile, E. D. Demaine, and S. Tazari. Polynomial-time approximation schemes for subset-connectivity problems in bounded genus graphs. In STACS, pages 171--182, 2009."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.59"},{"key":"e_1_3_2_1_12_1","first-page":"1285","volume-title":"SODA","author":"Borradaile G.","year":"2007","unstructured":"G. Borradaile , C. Mathieu , and P. N. Klein . A polynomial-time approximation scheme for Steiner tree in planar graphs . In SODA , pages 1285 -- 1294 , 2007 . G. Borradaile, C. Mathieu, and P. N. Klein. A polynomial-time approximation scheme for Steiner tree in planar graphs. In SODA, pages 1285--1294, 2007."},{"key":"e_1_3_2_1_13_1","first-page":"278","volume-title":"SODA","author":"Demaine E. D.","year":"2007","unstructured":"E. D. Demaine , M. Hajiaghayi , and B. Mohar . Approximation algorithms via contraction decomposition . In SODA , pages 278 -- 287 , 2007 . E. D. Demaine, M. Hajiaghayi, and B. Mohar. Approximation algorithms via contraction decomposition. In SODA, pages 278--287, 2007."},{"key":"e_1_3_2_1_14_1","volume-title":"Graph Theory (Graduate Texts in Mathematics)","author":"Diestel R.","year":"2005","unstructured":"R. Diestel . Graph Theory (Graduate Texts in Mathematics) . Springer , August 2005 . R. Diestel. Graph Theory (Graduate Texts in Mathematics). Springer, August 2005."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/0132071"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2009.05.002"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793242618"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/314500.314599"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.1975.5.1.45"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009758919736"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1137\/060649562"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.v49:4"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2008.04.002"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539796309764"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/646512.695348"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230160408"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480101393155"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(02)00414-0"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-5060(08)70655-1"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"crossref","unstructured":"A. Zelikovsky. An 11\/6-approximation algorithm for the network Steiner problem. Algorithmica 9(5):463--470 1993.  A. Zelikovsky. An 11\/6-approximation algorithm for the network Steiner problem. Algorithmica 9(5):463--470 1993.","DOI":"10.1007\/BF01187035"},{"key":"e_1_3_2_1_31_1","volume-title":"Better approximation bounds for the network and Euclidean Steiner tree problems. Technical report","author":"Zelikovsky A.","year":"1996","unstructured":"A. Zelikovsky . Better approximation bounds for the network and Euclidean Steiner tree problems. Technical report , University of Virginia , Charlottesville, VA, USA , 1996 . A. Zelikovsky. Better approximation bounds for the network and Euclidean Steiner tree problems. Technical report, University of Virginia, Charlottesville, VA, USA, 1996."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.5555\/646341.686725"}],"event":{"name":"STOC'10: Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Cambridge Massachusetts USA","acronym":"STOC'10"},"container-title":["Proceedings of the forty-second ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1806689.1806720","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1806689.1806720","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:39:37Z","timestamp":1750246777000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1806689.1806720"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6,5]]},"references-count":32,"alternative-id":["10.1145\/1806689.1806720","10.1145\/1806689"],"URL":"https:\/\/doi.org\/10.1145\/1806689.1806720","relation":{},"subject":[],"published":{"date-parts":[[2010,6,5]]},"assertion":[{"value":"2010-06-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}