{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T15:20:45Z","timestamp":1742397645438},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540885818"},{"type":"electronic","value":"9783540885825"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-88582-5_15","type":"book-chapter","created":{"date-parts":[[2008,10,14]],"date-time":"2008-10-14T21:28:50Z","timestamp":1224019730000},"page":"134-140","source":"Crossref","is-referenced-by-count":24,"title":["Construction of Minimum Connected Dominating Set in 3-Dimensional Wireless Network"],"prefix":"10.1007","author":[{"given":"Feng","family":"Zou","sequence":"first","affiliation":[]},{"given":"Xianyue","family":"Li","sequence":"additional","affiliation":[]},{"given":"Donghyun","family":"Kim","sequence":"additional","affiliation":[]},{"given":"Weili","family":"Wu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","volume-title":"On minimum connected donimating set problem in unit-ball graphs","author":"S. Butenko","year":"2007","unstructured":"Butenko, S., Ursulenko, O.: On minimum connected donimating set problem in unit-ball graphs. Elsevier Science, Amsterdam (2007) (preprint submitted)"},{"unstructured":"Cardei, M., Cheng, M.X., Cheng, X., Du, D.-Z.: Connected domination in multihop ad hoc wireless networks. In: International Conference on Computer Science and Informatics (2002)","key":"15_CR2"},{"unstructured":"Das, B., Bharghavan, V.: Routing in ad hoc Networks Using Minimum Connected Domianting Sets. In: International Conference on Communications (1997)","key":"15_CR3"},{"issue":"1","key":"15_CR4","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1109\/PROC.1987.13705","volume":"75","author":"A. Ephremides","year":"1987","unstructured":"Ephremides, A., Wieselthier, J., Baker, D.: A design concept for reliable mobile radio networks with frequency hopping signaling. Proc. IEEE\u00a075(1), 56\u201373 (1987)","journal-title":"Proc. IEEE"},{"issue":"4","key":"15_CR5","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":"15_CR6","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. Freeman, New York (1979)"},{"doi-asserted-by":"crossref","unstructured":"Li, Y., Kim, D., Zou, F., Du, D.-Z.: Constructing Connected Dominating Sets with Bounded Diameters in Wireless Networks. In: WASA (2007)","key":"15_CR7","DOI":"10.1109\/WASA.2007.8"},{"doi-asserted-by":"crossref","unstructured":"Ni, S., Tseng, Y., Chen, Y., Sheu, J.: The Broadcast Storm Problem in a Mobile Ad Hoc Network. In: MOBICOM 1999, Washington, USA, August 1999, pp. 152\u2013162 (1999)","key":"15_CR8","DOI":"10.1145\/313451.313525"},{"issue":"1-3","key":"15_CR9","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/j.tcs.2004.08.013","volume":"329","author":"L. Ruan","year":"2004","unstructured":"Ruan, L., Du, H., Jia, X., Wu, W., Li, Y., Ko, K.-I.: A Greedy Approximation for Minimum Connected Dominating Sets. Theoretical Computer Science\u00a0329(1-3), 325\u2013330 (2004)","journal-title":"Theoretical Computer Science"},{"unstructured":"Sivakumar, R., Das, B., Bharghavan, V.: An Improved Spine-based Infrastructure for Routing in Ad Hoc Networks. In: IEEE Symposium on Computers and Communications, Athens, Greece (June 1998)","key":"15_CR10"},{"doi-asserted-by":"crossref","unstructured":"Wan, P.-J., Alzoubi, K.M., Frieder, O.: Distributed Construction of Connected Dominating Sets in Wireless Ad Hoc Networks. In: Proc. IEEE Infocom 2002, New York, NY, USA (June 2002)","key":"15_CR11","DOI":"10.1145\/513819.513820"},{"doi-asserted-by":"crossref","unstructured":"Wu, J., Li, H.: On Calculating Connected Dominating Set for Ecient Routing in Ad Hoc Wireless Networks. In: Proc. the 3rd International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, Seattle, USA, August 1999, pp. 7\u201314 (1999)","key":"15_CR12","DOI":"10.1145\/313239.313261"}],"container-title":["Lecture Notes in Computer Science","Wireless Algorithms, Systems, and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-88582-5_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T13:07:50Z","timestamp":1557839270000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-88582-5_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540885818","9783540885825"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-88582-5_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}