{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T12:15:29Z","timestamp":1742386529013,"version":"3.35.0"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"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_17","type":"book-chapter","created":{"date-parts":[[2008,10,15]],"date-time":"2008-10-15T01:28:50Z","timestamp":1224034130000},"page":"154-161","source":"Crossref","is-referenced-by-count":3,"title":["PTAS for Minimum Connected Dominating Set in Unit Ball Graph"],"prefix":"10.1007","author":[{"given":"Zhao","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Xiaofeng","family":"Gao","sequence":"additional","affiliation":[]},{"given":"Weili","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Ding-Zhu","family":"Du","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Alzoubi, K.M., Wan, P., 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, Lausanne, Switzerland, June 09-11 (2002)","DOI":"10.1145\/513800.513820"},{"key":"17_CR2","unstructured":"Bharghavan, V., Das, B.: Routing in ad hoc networks using minimum connected dominating sets. In: International Conference on Communication, Montreal, Canada (June 1997)"},{"key":"17_CR3","first-page":"329","volume-title":"Handbook of combinatorial Optimization","author":"J. Blum","year":"2004","unstructured":"Blum, J., Ding, M., Cheng, X.: Applications of Connectd Dominating Sets in Wireless Netwoks. In: Du, D.-Z., Pardalos, P. (eds.) Handbook of combinatorial Optimization, pp. 329\u2013369. Kluwer Academic Publisher, Dordrecht (2004)"},{"key":"17_CR4","unstructured":"Butenko, S., Ursulenko, O.: On minimum connected dominating set problem in unit-ball graphs (submitted)"},{"key":"17_CR5","unstructured":"Cadei, M., Cheng, M.X., Cheng, X., Du, D.: Connected domination in ad hoc wireless networks. In: Proc. the Sixth International symposium on Mobile ad hoc networking and computing, Lausanne, Switzerland, June 09-11 (2002)"},{"key":"17_CR6","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.: A polynomial-time approximation scheme for minimum connected dominating set in ad hoc wireless networks. Networks\u00a042, 202\u2013208 (2003)","journal-title":"Networks"},{"key":"17_CR7","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 Math.\u00a086, 165\u2013177 (1990)","journal-title":"Discrete Math."},{"key":"17_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":"17_CR9","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. J. ACM\u00a032, 130\u2013136 (1985)","journal-title":"J. ACM"},{"key":"17_CR10","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/s10898-005-8466-1","volume":"35","author":"M. Min","year":"2006","unstructured":"Min, M., Du, H., Jia, X., Huang, C.X., Huang, S.C., Wu, W.: Improving construction for connected dominating set with Steiner tree in wireless sensor networks. J. Global Optimization\u00a035, 111\u2013119 (2006)","journal-title":"J. Global Optimization"},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"Peter Chen, Y., Liestman, A.L.: Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks. In: Proceedings of the third ACM international symposium on Mobile ad hoc networking and computing, Lausanne, Switzerland, June 09-11 (2002)","DOI":"10.1145\/513819.513821"},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"Ramamurthy, B., Iness, J., Mukherjee, B.: Minimizing the number of optical amplifiers needed to support a multi-wavelength optical LAN\/MAN. In: Proc. IEEE INFOCOM 1997, April 1997, pp. 261\u2013268 (1997)","DOI":"10.1109\/INFCOM.1997.635138"},{"key":"17_CR13","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.: A greedy approximation for minimum connected dominating set. Theoretical Computer Science\u00a0329, 325\u2013330 (2004)","journal-title":"Theoretical Computer Science"},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"Salhieh, A., Weinmann, J., Kochha, M., Schwiebert, L.: Power Efficient topologies for wireless sensor networks. In: ICPP 2001, pp. 156\u2013163 (2001)","DOI":"10.1109\/ICPP.2001.952059"},{"key":"17_CR15","unstructured":"Sivakumar, R., Das, B., Bharghavan, V.: An improved spine-based infrastructure for routing in ad hoc networks. In: IEEE Symposium on Computer and Communications, Athens, Greece (June 1998)"},{"key":"17_CR16","doi-asserted-by":"crossref","unstructured":"Stojmenovic, I., Seddigh, M., Zunic, J.: Dominating sets and neighbor elimination based broadcasting algorithms in wireless networks. In: Proc. IEEE Hawaii Int. Conf. on System Sciences (January 2001)","DOI":"10.1109\/71.980024"},{"key":"17_CR17","doi-asserted-by":"crossref","unstructured":"Wan, P., Alzoubi, K.M., Frieder, O.: Distributed construction of connected dominating set in wireless ad hoc networks. In: Proc. Infocom 2002 (2002)","DOI":"10.1145\/513819.513820"},{"key":"17_CR18","doi-asserted-by":"crossref","unstructured":"Wu, J., Li, H.L.: On calculating connected dominating set for efficient routing in ad hoc wireless networks. In: Proceedings of the 3rd ACM International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, pp. 7\u201314 (1999)","DOI":"10.1145\/313239.313261"},{"key":"17_CR19","volume-title":"Shere pachings","author":"C. Zong","year":"1999","unstructured":"Zong, C.: Shere pachings. Springer, New York (1999)"}],"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_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T19:16:27Z","timestamp":1738437387000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-88582-5_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540885818","9783540885825"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-88582-5_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}