{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:02:53Z","timestamp":1725562973272},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642146534"},{"type":"electronic","value":"9783642146541"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-14654-1_2","type":"book-chapter","created":{"date-parts":[[2010,8,19]],"date-time":"2010-08-19T08:02:22Z","timestamp":1282204942000},"page":"11-20","source":"Crossref","is-referenced-by-count":3,"title":["Heuristic Algorithms for Constructing Connected Dominating Sets with Minimum Size and Bounded Diameter in Wireless Networks"],"prefix":"10.1007","author":[{"given":"Jiguo","family":"Yu","sequence":"first","affiliation":[]},{"given":"Nannan","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Guanghui","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Alzoubi, K.M., Wan, P.J., Frieder, O.: Message-optimal connected dominating sets in mobile ad hoc networks. In: Proceedings of the 3rd ACM International Symposium on Mobile Ad Hoc Networking and Computing (June 2002)","DOI":"10.1145\/513800.513820"},{"key":"2_CR2","unstructured":"Cardei, M., Cheng, M.X., Cheng, X., Du, D.-Z.: Connected domination in ad hoc wireless networks. In: International Conference on Computer Science and Informatics (2002)"},{"key":"2_CR3","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"},{"issue":"2","key":"2_CR4","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1002\/wcm.378","volume":"6","author":"X. Cheng","year":"2006","unstructured":"Cheng, X., Ding, M., Du, H., Jia, X.: Virtual backbone construction in multi hop ad hoc wireless networks. Wireless Communications and Mobile Computing\u00a06(2), 183\u2013190 (2006)","journal-title":"Wireless Communications and Mobile Computing"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Das, B., Bharghavan, V.: Routing in ad hoc networks using minimum connected dominating sets. In: ICC 1997, Montreal, Canada (June 1997)","DOI":"10.1109\/ICC.1997.605303"},{"issue":"1","key":"2_CR6","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1109\/PROC.1987.13705","volume":"75","author":"A. Ephremides","year":"1987","unstructured":"Ephremides, A., Wieselthier, I., Baker, D.: A design concept for reliable mobile radio networks with frequency hopping signaling. Proc. IEEE\u00a075(1), 56\u201370 (1987)","journal-title":"Proc. IEEE"},{"key":"2_CR7","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.L. Garey","year":"1979","unstructured":"Garey, M.L., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, San Francisco (1979)"},{"key":"2_CR8","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, 374\u2013387 (1998)","journal-title":"Algorithmica"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Islam, K., Akl, S.G., Meijer, H.: A Constant Factor Localized Algorithm for Computing Connected Dominating Sets in Wireless Sensor Networks. In: 2008 14th IEEE International Conference on Parallel and Distributed Systems, pp. 559\u2013566 (2008)","DOI":"10.1109\/ICPADS.2008.78"},{"issue":"2","key":"2_CR10","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1109\/TPDS.2008.74","volume":"20","author":"D. Kim","year":"2009","unstructured":"Kim, D., Li, Y., Zou, F., Du, D.-Z.: Constructing Minimum Connected Dominating Sets with Bounded Diameters in Wireless Networks. IEEE Transactions on Parallel and Distributed System\u00a020(2), 147\u2013157 (2009)","journal-title":"IEEE Transactions on Parallel and Distributed System"},{"key":"2_CR11","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1002\/net.3230250205","volume":"25","author":"M.V. Marathe","year":"1995","unstructured":"Marathe, M.V., et al.: Simple heuristics for unit disk graphs. Networks\u00a025, 59\u201368 (1995)","journal-title":"Networks"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Mohammed, K., Gewali, L., Muthukumar, V.: Generating quality dominating sets for sensor networks. In: Proceedings of the Sixth International Conference on Computational Intelligence and Multimedia Applications, pp. 204\u2013211 (August 2005)","DOI":"10.1109\/ICCIMA.2005.33"},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"Schmid, S., Wattenhofer, R.: Algorithmic models for sensor networks. In: Proc. of the 14th International Workshop on Parallel and Distributed Real-Time Systems (2006)","DOI":"10.1109\/IPDPS.2006.1639417"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Vahdatpour, A., Dabiri, F., Moazeni, M., Sarrafzadeh, M.: Theoretical Bound and Practical Analysis of Connected Dominating Set in Ad Hoc and Sensor Networks. In: Proceedings of the 22nd International Symposium on Distributed Computing, pp. 481\u2013495 (2008)","DOI":"10.1007\/978-3-540-87779-0_33"},{"key":"2_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/978-3-540-88582-5_15","volume-title":"Wireless Algorithms, Systems, and Applications","author":"F. Zou","year":"2008","unstructured":"Zou, F., Li, X., Kim, D., Wu, W.: Construction of Minimum Connected Dominating Set in 3-Dimensional Wireless Network. In: Li, Y., Huynh, D.T., Das, S.K., Du, D.-Z. (eds.) WASA 2008. LNCS, vol.\u00a05258, pp. 134\u2013140. Springer, Heidelberg (2008)"}],"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-642-14654-1_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T19:55:15Z","timestamp":1552938915000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14654-1_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642146534","9783642146541"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14654-1_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}