{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:35:16Z","timestamp":1750307716837,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,6,21]],"date-time":"2009-06-21T00:00:00Z","timestamp":1245542400000},"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":[[2009,6,21]]},"DOI":"10.1145\/1582379.1582518","type":"proceedings-article","created":{"date-parts":[[2009,8,4]],"date-time":"2009-08-04T13:38:06Z","timestamp":1249393086000},"page":"639-643","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Approximating node-weighted multicast trees in wireless ad-hoc networks"],"prefix":"10.1145","author":[{"given":"Thomas","family":"Erlebach","sequence":"first","affiliation":[{"name":"University of Leicester, UK"}]},{"given":"Ambreen","family":"Shahnaz","sequence":"additional","affiliation":[{"name":"University of Leicester, UK"}]}],"member":"320","published-online":{"date-parts":[[2009,6,21]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(90)90358-O"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/0132071"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1998.2754"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009758919736"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1995.1029"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11276-007-0045-6"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00288961"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230250205"},{"key":"e_1_3_2_1_9_1","first-page":"770","volume-title":"Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'00)","author":"Robins G.","year":"2000","unstructured":"G. Robins and A. Zelikovsky . Improved Steiner tree approximation in graphs . In Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'00) , pages 770 -- 779 , 2000 . G. Robins and A. Zelikovsky. Improved Steiner tree approximation in graphs. In Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'00), pages 770--779, 2000."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/1898953.1899114"},{"key":"e_1_3_2_1_11_1","first-page":"573","article-title":"An approximate solution for the Steiner problem in graphs","volume":"24","author":"Takahashi H.","year":"1980","unstructured":"H. Takahashi and A. Matsuyama . An approximate solution for the Steiner problem in graphs . Mathematica Japonica , 24 : 573 -- 577 , 1980 . H. Takahashi and A. Matsuyama. An approximate solution for the Steiner problem in graphs. Mathematica Japonica, 24:573--577, 1980.","journal-title":"Mathematica Japonica"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.08.037"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/11534310_32"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"A. Zelikovsky. An 11\/6 approximation algorithm for the network Steiner problem. Algorithmica 9:463--470 1993.  A. Zelikovsky. An 11\/6 approximation algorithm for the network Steiner problem. Algorithmica 9:463--470 1993.","DOI":"10.1007\/BF01187035"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85097-7_26"}],"event":{"name":"IWCMC '09: 2009 International Wireless Communications and Mobile Computing Conference","sponsor":["ACM Association for Computing Machinery","Wiley-Blackwell","SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGCOMM ACM Special Interest Group on Data Communication","SIGMOBILE ACM Special Interest Group on Mobility of Systems, Users, Data and Computing","SIGDOC ACM Special Interest Group for Design of Communications"],"location":"Leipzig Germany","acronym":"IWCMC '09"},"container-title":["Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1582379.1582518","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1582379.1582518","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:30:24Z","timestamp":1750253424000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1582379.1582518"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6,21]]},"references-count":15,"alternative-id":["10.1145\/1582379.1582518","10.1145\/1582379"],"URL":"https:\/\/doi.org\/10.1145\/1582379.1582518","relation":{},"subject":[],"published":{"date-parts":[[2009,6,21]]},"assertion":[{"value":"2009-06-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}