{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T23:10:09Z","timestamp":1736118609933,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540308034"},{"type":"electronic","value":"9783540322962"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11596042_118","type":"book-chapter","created":{"date-parts":[[2005,11,24]],"date-time":"2005-11-24T15:14:40Z","timestamp":1132845280000},"page":"1157-1168","source":"Crossref","is-referenced-by-count":1,"title":["Multicast Routing with Minimum Energy Cost and Minimum Delay in Wireless Sensor Networks"],"prefix":"10.1007","author":[{"given":"Zhao","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hengchang","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Baohua","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yugui","family":"Qu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"118_CR1","doi-asserted-by":"crossref","unstructured":"Akyildiz, I., Su, W., Sankarasubramaniam, Y., Cayirci, E.: Wireless Sensor Networks: A Survey. Computer Networks\u00a038(4) (March 2002)","DOI":"10.1016\/S1389-1286(01)00302-4"},{"issue":"6","key":"118_CR2","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1109\/MM.2002.1134340","volume":"22","author":"J.L. Hill","year":"2002","unstructured":"Hill, J.L., Culler, D.E.: Mica: a wireless platform for deeply embedded networks. IEEE Micro\u00a022(6), 12\u201324 (2002)","journal-title":"IEEE Micro"},{"key":"118_CR3","doi-asserted-by":"crossref","unstructured":"Guo, X.: Broadcasting for Network Lifetime Maximization in Wireless Sensor Networks. In: First Annual IEEE Communications Society Conference, pp. 352\u2013358 (2004)","DOI":"10.1109\/SAHCN.2004.1381936"},{"key":"118_CR4","doi-asserted-by":"publisher","first-page":"934","DOI":"10.1109\/TCOM.1985.1096405","volume":"33","author":"R. Nelson","year":"1985","unstructured":"Nelson, R., Kleinrock, L.: Spatial-TDMA: A collision-free multihop channel access control. IEEE Transactions on Communications\u00a033, 934\u2013944 (1985)","journal-title":"IEEE Transactions on Communications"},{"key":"118_CR5","unstructured":"Prieto, R.D., Mancini, L.: LKHW: a directed diffusion-based secure multicast scheme for wireless sensor networks. In: Proceedings of the 2003 International Conference on Parallel Processing Workshops (ICPPW 2003), pp. 397\u2013406 (2003)"},{"key":"118_CR6","first-page":"2897","volume-title":"GLOBECOM 2004","author":"X. Jia","year":"2004","unstructured":"Jia, X., Li, D.: Multicast routing with minimum energy cost in ad hoc wireless networks. In: GLOBECOM 2004, vol.\u00a05, pp. 2897\u20132901. IEEE, Los Alamitos (2004)"},{"issue":"3","key":"118_CR7","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1109\/TNET.2004.828940","volume":"12","author":"P.-J. Wan","year":"2004","unstructured":"Wan, P.-J., Calinescu, G.: Minimum-power multicast routing in static ad hoc wireless networks. IEEE\/ACM Transactions on Networking\u00a012(3), 507\u2013514 (2004)","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"118_CR8","doi-asserted-by":"crossref","unstructured":"Intanagonwiwat, C., Govindan, R., Estrin, D.: Directed Diffusion: A Scalable and Robust Communicastion. In: MOBICOM 2000 (August 2000)","DOI":"10.1145\/345910.345920"},{"key":"118_CR9","doi-asserted-by":"crossref","unstructured":"Ye, F., Luo, H., Cheng, J., Lu, S., Zhang, L.: A Two-Tier Data Dissemination Model for Large-scale Wireless Sensor Networks. In: ACM International Conference on Mobile Computing and Network (MOBICOM 2002), pp. 148\u2013159 (September 2002)","DOI":"10.1145\/570645.570664"},{"key":"118_CR10","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, San Francisco (1979)"},{"key":"118_CR11","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/0020-0190(94)90139-2","volume":"52","author":"G. Galbiati","year":"1994","unstructured":"Galbiati, G., Maffioli, F., Morzenti, A.: A short note on the approximability of the maximum leaves spanning tree problem. Information Processing Letters\u00a052, 45\u201349 (1994)","journal-title":"Information Processing Letters"},{"key":"118_CR12","doi-asserted-by":"crossref","unstructured":"Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof verification and the hardness of approximation problems. In: Proceedings of the Thirty-third Annual IEEE Symposium on Foundations of Computer Science, pp. 14\u201323 (1992)","DOI":"10.1109\/SFCS.1992.267823"},{"key":"118_CR13","doi-asserted-by":"crossref","unstructured":"Arora, S., Safra, S.: Probabilistic checking of proofs: A new characterization of NP. In: Proceedings of the Thirty-third Annual IEEE Symposium on Foundations of Computer Science, pp. 2\u201313 (1992)","DOI":"10.1109\/SFCS.1992.267824"},{"issue":"1","key":"118_CR14","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1006\/jagm.1998.0944","volume":"29","author":"H. Lu","year":"1998","unstructured":"Lu, H., Ravi, R.: A near-linnear time approximation algorithm for maximum leaf spanning tree. Journal of Algorithms\u00a029(1), 132\u2013141 (1998)","journal-title":"Journal of Algorithms"},{"key":"118_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1007\/3-540-68530-8_37","volume-title":"Algorithms - ESA \u201998","author":"R. Solis-Oba","year":"1998","unstructured":"Solis-Oba, R.: 2-approximation algorithm for finding a spanning tree with maximum number of leaves. In: Bilardi, G., Pietracaprina, A., Italiano, G.F., Pucci, G. (eds.) ESA 1998. LNCS, vol.\u00a01461, pp. 441\u2013452. Springer, Heidelberg (1998)"},{"key":"118_CR16","doi-asserted-by":"crossref","unstructured":"Bjorklund, P., Varbrand, P., Yuan, D.: Resource optimization of spatial TDMA in ad hoc radio networks. In: Proceedings of the 2003 INFOCOM, San Francisco, CA, April1-3 (2003)","DOI":"10.1109\/INFCOM.2003.1208919"},{"key":"118_CR17","doi-asserted-by":"crossref","unstructured":"Gr\u00f6nkvist, J.: Traffic controlled spatial reuse TDMA in multi-hop radio networks. In: Proceedings of 9th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, pp. 1203\u20131207 (1998)","DOI":"10.1109\/PIMRC.1998.731370"}],"container-title":["Lecture Notes in Computer Science","Embedded and Ubiquitous Computing \u2013 EUC 2005 Workshops"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11596042_118.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T22:34:58Z","timestamp":1736116498000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11596042_118"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540308034","9783540322962"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11596042_118","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}