{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,4]],"date-time":"2025-01-04T16:10:15Z","timestamp":1736007015047,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540281023"},{"type":"electronic","value":"9783540318682"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11534310_32","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T13:48:30Z","timestamp":1127828910000},"page":"286-294","source":"Crossref","is-referenced-by-count":2,"title":["On the Minimization of the Number of Forwarding Nodes for Multicast in Wireless Ad Hoc Networks"],"prefix":"10.1007","author":[{"given":"Chen-guang","family":"Xu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yin-long","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun-min","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"32_CR1","doi-asserted-by":"crossref","unstructured":"Garcia-Luna-Aceves, J.J., Madruga, E.L.: The Core-Assisted Mesh Protocol. In: IEEE JSAC, August 1999, pp. 1380\u20131394 (1999)","DOI":"10.1109\/49.779921"},{"key":"32_CR2","doi-asserted-by":"crossref","unstructured":"Chen, K., Nahrstedt, K.: Effective Location-Guided Tree Construction Algorithms for Small Group Multicast in MANET. In: Proc. INFOCOM, pp. 1180\u20131189 (2002)","DOI":"10.1109\/INFCOM.2002.1019368"},{"key":"32_CR3","unstructured":"Gerla, M., Lee, S.J., Su, W.: On-Demand Multicast Routing Protocol (ODMRP) for Ad Hoc Networks. Internet draft, draft-ietf-manet-odmrp-02.txt (2000)"},{"key":"32_CR4","doi-asserted-by":"crossref","unstructured":"Wu, J., Gao, M., Stojmenovic, I.: On calculating power-aware connected dominating sets for efficient routing in ad hoc wireless networks. In: International Conference on Parallel Processing, pp. 346\u2013354 (2001)","DOI":"10.1109\/ICPP.2001.952080"},{"key":"32_CR5","doi-asserted-by":"crossref","unstructured":"Dai, F., Wu, J.: An Extended Localized Algorithm for Connected Dominating Set For-mation in Ad Hoc Wireless Networks. IEEE Trans on Parallel and Distributed Systems\u00a015(10) (October 2004)","DOI":"10.1109\/TPDS.2004.48"},{"key":"32_CR6","doi-asserted-by":"crossref","unstructured":"Das, B., Bharghavan, V.: Routing in ad-hoc networks using minimum connected dominating sets. In: IEEE International Conference on Communications, June 1997, pp. 376\u2013380 (1997)","DOI":"10.1109\/ICC.1997.605303"},{"issue":"3","key":"32_CR7","first-page":"189","volume":"9","author":"J. Wu","year":"2002","unstructured":"Wu, J.: Extended Dominating-Set-Based Routing in Ad Hoc Wireless Networks with Unidirectional Links. IEEE Trans. on Parallel and Distributed Systems\u00a09(3), 189\u2013200 (2002)","journal-title":"IEEE Trans. on Parallel and Distributed Systems"},{"key":"32_CR8","doi-asserted-by":"crossref","unstructured":"Butenko, S., Cheng, X., Du, D.-Z., Pardalos, P.M.: On the con-struction of virtual backbone for ad hoc wireless networks. In: Cooperative Systems, vol.\u00a01, ch. 1, pp. 43\u201354. Kluwer Academic Publishers, Dordrecht (2003)","DOI":"10.1007\/978-1-4757-3758-5_3"},{"key":"32_CR9","doi-asserted-by":"crossref","unstructured":"Wan, P.-J., Alzoubi, K.M., Frieder, O.: Distributed construction of connected domi-nating set in wireless ad hoc networks. In: IEEE INFOCOM (June 2002)","DOI":"10.1145\/513800.513820"},{"issue":"4","key":"32_CR10","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1002\/net.10097","volume":"42","author":"X. Cheng","year":"2003","unstructured":"Cheng, X., Huang, X., Li, D., Wu, W., Du., D.-Z.: Polynomial-time approximation scheme for minimum connected dominating set in ad hoc wireless networks. Networks\u00a042(4), 202\u2013208 (2003)","journal-title":"Networks"},{"key":"32_CR11","unstructured":"Wu, Y., Xu, Y., Chen, G., Wang, K.: On the Construction of Virtual Multicast Backbone for Wireless Ad Hoc Networks. In: IEEE MASS (October 2004)"},{"issue":"4","key":"32_CR12","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/PL00009201","volume":"20","author":"S. Guha","year":"1998","unstructured":"Guha, S., Khuller, S.: Approximation algorithms for connected dominating sets. Algorithmica\u00a020(4), 374\u2013387 (1998)","journal-title":"Algorithmica"},{"key":"32_CR13","unstructured":"Robins, G., Zelikovsky, A.: Improved Steiner tree approximation in graphs. In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 770\u2013779 (2000)"},{"key":"32_CR14","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0012-365X(90)90358-O","volume":"86","author":"B.N. Clark","year":"1990","unstructured":"Clark, B.N., Colbourn, C.J., Johnson, D.S.: Unit Disk Graphs. Discrete Mathematics\u00a086, 165\u2013177 (1990)","journal-title":"Discrete Mathematics"},{"key":"32_CR15","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1006\/inco.1998.2754","volume":"150","author":"S. Guha","year":"1999","unstructured":"Guha, S., Khuller, S.: Improved methods for approximating node weighted Steiner trees and connected dominating sets. Inform and Computing\u00a0150, 57\u201374 (1999)","journal-title":"Inform and Computing"},{"key":"32_CR16","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1145\/2455.214106","volume":"32","author":"D.S. Hochbaum","year":"1985","unstructured":"Hochbaum, D.S., Maass, W.: Approximation schemes for covering and packing problems in image processing and VLSI. Journal of ACM\u00a032, 130\u2013136 (1985)","journal-title":"Journal of ACM"},{"key":"32_CR17","doi-asserted-by":"crossref","unstructured":"Li, X.-y., Wang, Y.: Simple heuristics and PTASs for intersection graphs in wireless ad hoc networks. In: ACM Dial-M, Atlanta, Georgia, USA, September 28 (2002)","DOI":"10.1145\/570810.570819"},{"key":"32_CR18","unstructured":"Wang, S.-h.: Graph Theory and its algorithm, p. 127. USTC Press (1990)"}],"container-title":["Lecture Notes in Computer Science","Networking and Mobile Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11534310_32.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,4]],"date-time":"2025-01-04T15:39:54Z","timestamp":1736005194000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11534310_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540281023","9783540318682"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/11534310_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}