{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,11]],"date-time":"2025-01-11T10:40:12Z","timestamp":1736592012884,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540371892"},{"type":"electronic","value":"9783540371908"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11814856_47","type":"book-chapter","created":{"date-parts":[[2006,10,9]],"date-time":"2006-10-09T15:04:00Z","timestamp":1160406240000},"page":"490-501","source":"Crossref","is-referenced-by-count":4,"title":["Minimum Multicast Time Problem in Wireless Sensor Networks"],"prefix":"10.1007","author":[{"given":"Jianming","family":"Zhu","sequence":"first","affiliation":[]},{"given":"Xujin","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Xiaodong","family":"Hu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"47_CR1","doi-asserted-by":"crossref","unstructured":"Annamalai, V., Gupta, S.K.S., Schwiebert, L.: On tree-based convergecasting in wireless sensor networks. In: WCNC 2003-IEEE Wireless Communication and Networking Conference, vol.\u00a04(1), pp. 1942\u20131947 (2003)","DOI":"10.1109\/WCNC.2003.1200684"},{"issue":"2","key":"47_CR2","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1137\/S0097539798347906","volume":"30","author":"A. Bar-Noy","year":"2000","unstructured":"Bar-Noy, A., Guha, S., Naor, J., Schieber, B.: Message multicasting in heterogeneous networks. SIAM Journal on Computing\u00a030(2), 347\u2013358 (2000)","journal-title":"SIAM Journal on Computing"},{"key":"47_CR3","doi-asserted-by":"crossref","unstructured":"Bulusu, N., Heidemann, J., Estrin, D.: GPS-less low cost outdoor localization for very small devices. Technical Report 00-729, Computer Science Department, University of Sourthern California (April 2000)","DOI":"10.1109\/98.878533"},{"key":"47_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/11599463_14","volume-title":"Mobile Ad-hoc and Sensor Networks","author":"X. Chen","year":"2005","unstructured":"Chen, X., Hu, X., Zhu, J.: Minimum Data Aggregation Time Problem in Wireless Sensor Networks. In: Jia, X., Wu, J., He, Y. (eds.) MSN 2005. LNCS, vol.\u00a03794, pp. 133\u2013142. Springer, Heidelberg (2005)"},{"key":"47_CR5","doi-asserted-by":"crossref","unstructured":"Elkin, M., Kortsarz, G.: A combinatorial logarithmic approximation algorithm for the directed telephone broadcast problem. In: Proceedings of 34th ACM Annual Symposium on Theory of Computing, pp. 438\u2013447 (2002)","DOI":"10.1145\/509907.509972"},{"key":"47_CR6","doi-asserted-by":"crossref","unstructured":"Elkin, M., Kortsarz, G.: Sublogarithmic approximation algorithm for the undirected telephone broadcast problem: a path out of a jungle. In: Proceedings of 14th Annual ACM-SCIM Symposium on Discrete Algorithms, pp. 76\u201385 (2003)","DOI":"10.1145\/509907.509972"},{"key":"47_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1007\/3-540-45061-0_19","volume-title":"Automata, Languages and Programming","author":"M. Elkin","year":"2003","unstructured":"Elkin, M., Kortsarz, G.: Approximation algorithm for directed telephone multicast problem. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 212\u2013223. Springer, Heidelberg (2003)"},{"key":"47_CR8","doi-asserted-by":"crossref","unstructured":"Gandhi, R., Parthasarathy, S., Mishr\u0300a, A.: Minimizing broadcasting latency and redundancy in ad hoc networks. In: Proceedings of the 4th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, pp. 222\u2013231 (2003)","DOI":"10.1145\/778440.778442"},{"key":"47_CR9","volume-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-completeness. W. H. Freeman and Company, New York (1979)"},{"key":"47_CR10","doi-asserted-by":"crossref","unstructured":"Intanagonwiwat, C., Estrin, D., Govindan, R., Heidemann, J.: Impact of network density on data aggregation in wireless sensor networks. In: The 22nd International Conference on Distributed Computing Systems, Austria (July 2002)","DOI":"10.1109\/ICDCS.2002.1022289"},{"key":"47_CR11","doi-asserted-by":"crossref","unstructured":"Kyasanur, P., Vaidya, N.: Routing and interface assignment in multi-channel wireless networks. In: Proceedings of IEEE Wireless Communications and Networking Conference, vol.\u00a04, pp. 2051\u20132056 (2005)","DOI":"10.1109\/WCNC.2005.1424834"},{"key":"47_CR12","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1137\/0211025","volume":"11","author":"D. Lichtenstein","year":"1982","unstructured":"Lichtenstein, D.: Planar formulae and their uses. SIAM Journal on Computing\u00a011, 329\u2013343 (1982)","journal-title":"SIAM Journal on Computing"},{"key":"47_CR13","volume-title":"Handbook of Wireless Networks and Mobile Computing","author":"A. Pelc","year":"2002","unstructured":"Pelc, A.: Broadcasting in radio networks. In: Handbook of Wireless Networks and Mobile Computing, John Wiley and Sons, Inc., New York (2002)"},{"key":"47_CR14","doi-asserted-by":"crossref","unstructured":"Ravi, R.: Rapid rumor ramification: approximating the minimum broadcast time. In: Proceedings of the IEEE Symposium on Computer Science, pp. 202\u2013213 (1994)","DOI":"10.1109\/SFCS.1994.365693"},{"key":"47_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/b117506","volume-title":"Wireless Sensor Networks","author":"C.S. Raghavendra","year":"2004","unstructured":"Raghavendra, C.S., Sivalingam, K.M., Znati, T.: Wireless Sensor Networks. Kluwer Academic Publishers, Dordrecht (2004)"},{"key":"47_CR16","doi-asserted-by":"publisher","first-page":"692","DOI":"10.1137\/0210052","volume":"10","author":"P.J. Slater","year":"1981","unstructured":"Slater, P.J., Cockayne, E.J., Hedetniemi, S.T.: Information dissemination in trees. SIAM Journal on Computing\u00a010, 692\u2013701 (1981)","journal-title":"SIAM Journal on Computing"},{"key":"47_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1007\/11599463_62","volume-title":"Mobile Ad-hoc and Sensor Networks","author":"L. Xu","year":"2005","unstructured":"Xu, L., Xiang, Y., Shi, M.: On the Problem of Channel Assignment for Multi-NIC Multihop Wireless Networks. In: Jia, X., Wu, J., He, Y. (eds.) MSN 2005. LNCS, vol.\u00a03794, pp. 633\u2013642. Springer, Heidelberg (2005)"},{"key":"47_CR18","unstructured":"Yu, Y., Krishnamachari, B., Prasanna, V.K.: Energy-latency tradeoffs for data gathering in wireless sensor networks. In: The 23rd Conference of IEEE Communication Society, Hong Kong, SAR China (March 2004)"}],"container-title":["Lecture Notes in Computer Science","Wireless Algorithms, Systems, and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11814856_47.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,11]],"date-time":"2025-01-11T09:29:20Z","timestamp":1736587760000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11814856_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540371892","9783540371908"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/11814856_47","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}