{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T19:30:51Z","timestamp":1777404651772,"version":"3.51.4"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2006,5,1]],"date-time":"2006-05-01T00:00:00Z","timestamp":1146441600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2006,5]]},"DOI":"10.1007\/s10898-005-8466-1","type":"journal-article","created":{"date-parts":[[2006,5,18]],"date-time":"2006-05-18T07:23:21Z","timestamp":1147937001000},"page":"111-119","source":"Crossref","is-referenced-by-count":118,"title":["Improving Construction for Connected Dominating Set with Steiner Tree in Wireless Sensor Networks"],"prefix":"10.1007","volume":"35","author":[{"given":"Manki","family":"Min","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hongwei","family":"Du","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaohua","family":"Jia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christina Xiao","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Scott C.-H.","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weili","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8466_CR1","doi-asserted-by":"crossref","unstructured":"Alzoubi, K. M., Wan, P. -J., and Frieder, O. (2002) Message-optimal connected dominating sets in mobile ad hoc networks, Proceedings of the 3rd ACM International Symposium on Mobile ad hoc Networking and Computing, June 09\u201311, Lausanne, Switzerland.","DOI":"10.1145\/513800.513820"},{"key":"8466_CR2","unstructured":"Bharghavan, V. and Das, B. Routing in ad hoc networks using minimum connected dominating sets, International Conference on Communication, Montreal, Canada, June 1997."},{"key":"8466_CR3","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1023\/A:1008384012064","volume":"18","author":"D. Chen","year":"2000","journal-title":"Journal of Global Optimization"},{"key":"8466_CR4","doi-asserted-by":"crossref","unstructured":"Chen, Y. P. and Liestman, A. L. (2002), Approximating minimum size weakly connected dominating sets for clustering mobile ad hoc networks, Proceedings of the third ACM International Symposium on Mobile ad hoc Networking and Computing, June 09\u201311, Lausanne, Switzerland.","DOI":"10.1145\/513800.513821"},{"key":"8466_CR5","unstructured":"Cadei, M., Cheng, M.X., Cheng, X. and Du, D.-Z. (2002), Connected domination in ad hoc wireless networks, Proceedings the Sixth International Conference on Computer Science and Informatics (CS& I\u20192002)."},{"key":"8466_CR6","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1002\/net.10097","volume":"42","author":"X. Cheng","year":"2003","journal-title":"Networks"},{"key":"8466_CR7","doi-asserted-by":"crossref","unstructured":"Deering, S., Farinacci, D., Jacobson, V., Lui, C. and Wei, L. (1994), An Architecture for Wide Area Multicast Routing, Proceedings of ACM SIGCOMM 1994, September 1994.","DOI":"10.1145\/190314.190326"},{"key":"8466_CR8","doi-asserted-by":"crossref","unstructured":"Du, D. -Z., Wang, L. and Xu, B. (2001), The Euclidean Bottleneck Steiner Tree and Steiner Tree with Minimum Number of Steiner Points, COCOON\u2019 2001, pp. 509\u2013518","DOI":"10.1007\/3-540-44679-6_57"},{"key":"8466_CR9","doi-asserted-by":"crossref","unstructured":"Eriksson, H. (1994), MBone: The Multicast Backbone, Communications of the ACM, August 1994.","DOI":"10.1145\/179606.179627"},{"issue":"4","key":"8466_CR10","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1007\/PL00009201","volume":"20","author":"S. Guha","year":"1998","journal-title":"Algorithmica"},{"key":"8466_CR11","doi-asserted-by":"crossref","unstructured":"Lin G.-H. and Xue G.L. (1999) Steiner tree problem with minimum number of Steiner points and bounded edge-length. Information Processing Letters 69:53\u201357","DOI":"10.1016\/S0020-0190(98)00201-4"},{"key":"8466_CR12","unstructured":"Ramamurthy, B., Iness J. and Mukherjee, B. (1997), Minimizing the number of optical amplifiers needed to support a multi-wavelength optical LAN\/MAN, Proceeding IEEE INFOCOM\u201997, pp. 261\u2013268, April 1997."},{"issue":"1\u20133","key":"8466_CR13","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/j.tcs.2004.08.013","volume":"329","author":"L. Ruan","year":"2004","journal-title":"Theoretical Computer Science"},{"key":"8466_CR14","doi-asserted-by":"crossref","unstructured":"Salhieh, A., Weinmann, J., Kochha, M. and Schwiebert, L. (2001), Power Efficient topologies for wireless sensor networks, ICPP\u20192001, pp. 156\u2013163.","DOI":"10.1109\/ICPP.2001.952059"},{"key":"8466_CR15","unstructured":"Sivakumar, R., Das, B. and Bharghavan, V. (1998), An improved spine-based infrastructure for routing in ad hoc networks, IEEE Symposium on Computer and Communications, Athens, Greece, June, 1998."},{"key":"8466_CR16","unstructured":"Stojmenovic, I., Seddigh, M. and Zunic, J. (2001), Dominating sets and neighbor elimination based broadcasting algorithms in wireless networks, Proceeding IEEE Hawaii International Conference on System Sciences, January 2001."},{"key":"8466_CR17","doi-asserted-by":"crossref","unstructured":"Wan, P.-J., Alzoubi, K.M. and Frieder, O. (2002), Distributed construction of connected dominating set in wireless ad hoc networks, Proceedings of Infocom\u20192002.","DOI":"10.1145\/513819.513820"},{"key":"8466_CR18","unstructured":"Wu J. and Li, H.L. (1991), On calculating connected dominating set for efficient routing in ad hoc wireless networks, Proceedings of the 3rd ACM International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, pp. 7\u201314."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-005-8466-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-005-8466-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-005-8466-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T08:12:05Z","timestamp":1559290325000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-005-8466-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,5]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2006,5]]}},"alternative-id":["8466"],"URL":"https:\/\/doi.org\/10.1007\/s10898-005-8466-1","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,5]]}}}