{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T11:58:41Z","timestamp":1742990321088,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":15,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387307701"},{"type":"electronic","value":"9780387301624"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-30162-4_476","type":"book-chapter","created":{"date-parts":[[2008,6,26]],"date-time":"2008-06-26T18:37:21Z","timestamp":1214505441000},"page":"1020-1023","source":"Crossref","is-referenced-by-count":0,"title":["Weighted Connected Dominating Set"],"prefix":"10.1007","author":[{"given":"Yu","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weizhao","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiang-Yang","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"476_CR1_476","unstructured":"Alzoubi, K., Wan, P.-J., Frieder, O.: New distributed algorithm for connected dominating set in wireless ad hoc networks. In: Proceedings of IEEE 35th Hawaii International Conference on System Sciences (HICSS-35), Hawaii, 7\u201310 January 2002"},{"key":"476_CR2_476","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1109\/TPDS.2003.1195412","volume":"14","author":"K. Alzoubi","year":"2003","unstructured":"Alzoubi, K., Li, X.-Y., Wang, Y., Wan, P.-J., Frieder, O.: Geometric spanners for wireless ad hoc networks. IEEE Trans. Parallel Distrib. Process. 14, 408\u2013421 (2003)","journal-title":"IEEE Trans. Parallel Distrib. Process."},{"key":"476_CR3_476","first-page":"3","volume-title":"Proceedings of the 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2006), Barcelona, 28\u201330 August 2006, LNCS, vol. 4110","author":"C. Ambuhl","year":"2006","unstructured":"Ambuhl, C., Erlebach, T., Mihalak, M., Nunkesser, M.: Constant-factor approximation for minimum-weight (connected) dominating sets in unit disk graphs. In: Proceedings of the 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2006), Barcelona, 28\u201330 August 2006, LNCS, vol.\u00a04110, pp.\u00a03\u201314. Springer, Berlin Heidelberg (2006)"},{"key":"476_CR4_476","first-page":"129","volume-title":"Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing, Annapolis, 1\u20133 June 2003","author":"L. Bao","year":"2003","unstructured":"Bao, L., Garcia\u2212Aceves, J.J.: Topology management in ad hoc networks. In: Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing, Annapolis, 1\u20133 June 2003, pp.\u00a0129\u2013140. ACM Press, New York (2003)"},{"key":"476_CR5_476","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1023\/A:1013941929408","volume":"5","author":"M. Chatterjee","year":"2002","unstructured":"Chatterjee, M., Das, S., Turgut, D.: WCA: A\u00a0weighted clustering algorithm for mobile ad hoc networks. J.\u00a0Clust. Comput. 5, 193\u2013204 (2002)","journal-title":"J. Clust. Comput."},{"key":"476_CR6_476","doi-asserted-by":"crossref","unstructured":"Das, B., Bharghavan, V.: Routing in ad-hoc networks using minimum connected dominating sets. In: Proceedings of IEEE International Conference on on Communications (ICC'97), vol.\u00a01, pp.\u00a0376\u2013380. Montreal, 8\u201312 June 1997","DOI":"10.1109\/ICC.1997.605303"},{"key":"476_CR7_476","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1006\/inco.1998.2754","volume":"150","author":"S. Guhaa","year":"1999","unstructured":"Guhaa, S., Khuller, S.: Improved methods for approximating node weighted Steiner trees and connected dominating sets. Inf. Comput. 150,\u00a057\u201374 (1999)","journal-title":"Inf. Comput."},{"key":"476_CR8_476","unstructured":"Kachirski, O., Guha, R.: Intrusion detection using mobile agents in wireless ad hoc networks. In: Proceedings of IEEE Workshop on Knowledge Media Networking, Kyoto, 10\u201312 July 2002"},{"key":"476_CR9_476","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1006\/jagm.1995.1029","volume":"19","author":"P. Klein","year":"1995","unstructured":"Klein, P., Ravi, R.: A\u00a0nearly best-possible approximation algorithm for node-weighted Steiner trees. J.\u00a0Algorithms 19,\u00a0104\u2013115 (1995)","journal-title":"J. Algorithms"},{"key":"476_CR10_476","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Moscibroda, T., Wattenhofer, R.: What cannot be computed locally! In: Proceedings of the 23rd ACM Symposium on the Principles of Distributed Computing (PODC), St. John's, July (2004)","DOI":"10.1145\/1011767.1011811"},{"key":"476_CR11_476","doi-asserted-by":"crossref","unstructured":"Li, X.-Y., Wan, P.-J.: Theoretically good distributed CDMA\/OVSF code assignment for wireless ad hoc networks. In: Proceedings of 11th Internatioanl Computing and Combinatorics Conference (COCOON), Kunming, 16\u201319 August 2005","DOI":"10.1007\/11533719_15"},{"key":"476_CR12_476","doi-asserted-by":"crossref","unstructured":"Wang, Y., Wang, W., Li, X.-Y.: Efficient distributed low-cost backbone formation for wireless networks. In: Proceedings of 6th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc 2005), Urbana-Champaign, 25\u201327 May 2005","DOI":"10.1145\/1062689.1062692"},{"key":"476_CR13_476","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1109\/TPDS.2006.86","volume":"17","author":"Y. Wang","year":"2006","unstructured":"Wang, Y., Wang, W., Li, X.-Y.: Efficient distributed low cost backbone formation for wireless networks. IEEE Trans. Parallel Distrib. Syst. 17,\u00a0681\u2013693 (2006)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"476_CR14_476","first-page":"63","volume":"3","author":"J. Wu","year":"2001","unstructured":"Wu, J., Li, H.: A\u00a0dominating-set-based routing scheme in ad hoc wireless networks. The special issue on Wirel. Netw. Telecommun. Systems J. 3,\u00a063\u201384 (2001)","journal-title":"Netw. Telecommun. Systems J."},{"key":"476_CR15_476","unstructured":"Zheng, R., He, G., Gupta, I., Sha, L.: Time idexing in sensor networks. In: Proceedings of 1st IEEE International Conference on Mobile Ad-hoc and Sensor Systems (MASS), Fort Lauderdale, 24\u201327 October 2004"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-30162-4_476","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T21:32:50Z","timestamp":1738272770000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-30162-4_476"}},"subtitle":["2005; Wang, Wang, Li"],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387307701","9780387301624"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-30162-4_476","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}