{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T18:35:24Z","timestamp":1777487724116,"version":"3.51.4"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,8,11]],"date-time":"2010-08-11T00:00:00Z","timestamp":1281484800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2012,1]]},"DOI":"10.1007\/s10878-010-9346-2","type":"journal-article","created":{"date-parts":[[2010,8,10]],"date-time":"2010-08-10T16:01:45Z","timestamp":1281456105000},"page":"118-139","source":"Crossref","is-referenced-by-count":32,"title":["On the construction of k-connected m-dominating sets in wireless networks"],"prefix":"10.1007","volume":"23","author":[{"given":"Yingshu","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yiwei","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chunyu","family":"Ai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Raheem","family":"Beyah","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,8,11]]},"reference":[{"key":"9346_CR1","unstructured":"Alzoubi KM, Wan P-J, Frieder O (2002a) New distributed algorithm for connected dominating set in wireless ad hoc networks. In: Proc. 35th Hawaii international conference on system sciences, Big Island, Hawaii"},{"issue":"1","key":"9346_CR2","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1109\/JCN.2002.6596929","volume":"4","author":"KM Alzoubi","year":"2002","unstructured":"Alzoubi KM, Wan P-J, Frieder O (2002b) Distributed heuristics for connected dominating sets in wireless ad hoc networks. J Commun Netw 4(1):22\u201329","journal-title":"J Commun Netw"},{"key":"9346_CR3","doi-asserted-by":"crossref","unstructured":"Alzoubi KM, Wan P-J, Frieder O (2002c) Message-optimal connected dominating sets in mobile ad hoc networks. In: Proc. 3rd ACM international symposium on mobile ad hoc networking and computing, EPFL Lausanne, Switzerland","DOI":"10.1145\/513819.513820"},{"key":"9346_CR4","doi-asserted-by":"crossref","unstructured":"Bettstetter C (2002) On the minimum node degree and connectivity of a wireless multihop network. In: Proc. 3rd ACM international symposium on mobile ad hoc networking and computing, EPFL Lausanne, Switzerland","DOI":"10.1145\/513810.513811"},{"key":"9346_CR5","unstructured":"Cardei M, Cheng X, Du D-Z (2002) Connected domination in ad hoc wireless networks. In: Proc. 6th international conference on computer science and informatics"},{"issue":"2","key":"9346_CR6","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1002\/wcm.378","volume":"6","author":"X Cheng","year":"2006","unstructured":"Cheng X, Ding M, Du D, Jia X (2006) Virtual backbone construction in multihop ad hoc wireless networks. Wirel Commun Mob Comput 6(2):183\u2013190","journal-title":"Wirel Commun Mob Comput"},{"key":"9346_CR7","isbn-type":"print","volume-title":"Introduction to algorithms","author":"TH Cormen","year":"2001","unstructured":"Cormen TH, Leiserson CE, Rivest RL, Stein C (2001) Introduction to algorithms. MIT Press, Cambridge. ISBN 0-262-03293-7","ISBN":"https:\/\/id.crossref.org\/isbn\/0262032937"},{"key":"9346_CR8","unstructured":"Dai F, Wu J (2005) On constructing k-connected k-dominating set in wireless network. In: Proc. 19th international parallel and distributed processing symposium, Denver, Colorado"},{"key":"9346_CR9","doi-asserted-by":"crossref","unstructured":"Das B, Bharghavan V (1997) Routing in ad-hoc networks using minimum connected dominating sets. In: Proc. international conference on communications, Montreal, Canada, June 1997","DOI":"10.1109\/ICC.1997.605303"},{"key":"9346_CR10","doi-asserted-by":"crossref","unstructured":"Das B, Sivakumar R, Bharghavan V (1997) Routing in ad hoc networks using a spine. In: Proc. 6th international conference on computers and communications networks, Las Vegas, NV, September 1997","DOI":"10.1109\/ICCCN.1997.623288"},{"key":"9346_CR11","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1109\/PROC.1987.13705","volume":"75","author":"A Ephremides","year":"1987","unstructured":"Ephremides A, Wieselthier J, Baker D (1987) A design concept for reliable mobile radio networks with frequency hopping signaling. Proc IEEE 75:56\u201373","journal-title":"Proc IEEE"},{"issue":"4","key":"9346_CR12","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1007\/PL00009201","volume":"20","author":"S Guha","year":"1998","unstructured":"Guha S, Khuller S (1998) Approximation algorithms for connected dominating sets. Algorithmica 20(4):374\u2013387","journal-title":"Algorithmica"},{"issue":"2","key":"9346_CR13","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1109\/TPDS.2008.74","volume":"20","author":"D Kim","year":"2009","unstructured":"Kim D, Wu Y, Li Y, Zou F, Du D-Z (2009) Constructing minimum connected dominating sets with bounded diameters in wireless networks. IEEE Trans Parallel Distrib Syst 20(2):147\u2013157","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"9346_CR14","unstructured":"Li Y, Zhu S, Thai MT, Du D-Z (2004) Localized construction of connected dominating set in wireless networks. In: NSF international workshop on theoretical aspects of wireless ad hoc, sensor and peer-to-peer networks, Chicago, June 2004"},{"key":"9346_CR15","unstructured":"Ni S-Y, Tseng YC, Chen Y-S, Shen J-P (1999) The broadcast storm problem in a mobile ad hoc network. In: Proc. 5th annual international conference on mobile computing and networking, August 1999, pp\u00a0151\u2013162"},{"key":"9346_CR16","series-title":"LNCS","first-page":"182","volume-title":"COCOA 2007","author":"W Shang","year":"2007","unstructured":"Shang W, Yao F, Wan P, Hu X (2007) Algorithms for minimum m-connected k-dominating set problem. In: COCOA 2007. LNCS, vol 4616. Springer, Berlin, pp 182\u2013190"},{"key":"9346_CR17","unstructured":"Sivakumar R, Das B, Bharghavan V (1998) An improved spine-based infrastructure for routing in ad hoc networks. In: IEEE symposium on computers and communications, Athens, Greece, June 1998"},{"key":"9346_CR18","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/j.tcs.2007.05.025","volume":"385","author":"MT Thai","year":"2007","unstructured":"Thai MT, Zhang N, Tiwari R, Xu X (2007) On approximation algorithms of k-connected m-dominating sets in disk graphs. Theor Comput Sci 385:49\u201359","journal-title":"Theor Comput Sci"},{"key":"9346_CR19","unstructured":"Wan P-J, Alzoubi KM, Frieder O (2002) Distributed construction of connected dominating sets in wireless ad hoc networks. In: Proc 21st annual joint conference of the IEEE computer and communications societies, vol\u00a03, pp\u00a01597\u20131604"},{"issue":"3","key":"9346_CR20","doi-asserted-by":"crossref","first-page":"1230","DOI":"10.1109\/TWC.2009.051053","volume":"8","author":"F Wang","year":"2009","unstructured":"Wang F, Thai MT, Du D-Z (2009) On the construction of 2-connected virtual backbone in wireless networks. IEEE Trans Wirel Commun 8(3):1230\u20131237","journal-title":"IEEE Trans Wirel Commun"},{"key":"9346_CR21","isbn-type":"print","volume-title":"Introduction to graph theory","author":"DB West","year":"2001","unstructured":"West DB (2001) Introduction to graph theory, 2nd edn. Prentice-Hall, New York. ISBN 0-13-014400-2","ISBN":"https:\/\/id.crossref.org\/isbn\/0130144002","edition":"2"},{"key":"9346_CR22","doi-asserted-by":"crossref","unstructured":"Wu J, Li H (1999) On calculating connected dominating set for efficient routing in ad hoc wireless networks. In: Proc. 3rd international workshop on discrete algorithms and methods for mobile computing and communications, August 1999, pp\u00a07\u201314,","DOI":"10.1145\/313239.313261"},{"key":"9346_CR23","doi-asserted-by":"crossref","unstructured":"Wu Y, Wang F, Thai MT, Li Y (2007) Constructing k-connected m-dominating sets in wireless sensor networks. In: Military communications conference, Orlando, FL, October 29\u201331, 2007","DOI":"10.1109\/MILCOM.2007.4454774"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-010-9346-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-010-9346-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-010-9346-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T15:05:36Z","timestamp":1559401536000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-010-9346-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,8,11]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,1]]}},"alternative-id":["9346"],"URL":"https:\/\/doi.org\/10.1007\/s10878-010-9346-2","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,8,11]]}}}