{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T19:45:54Z","timestamp":1760298354137},"reference-count":6,"publisher":"World Scientific Pub Co Pte Lt","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2011,3]]},"abstract":"<jats:p> Connected dominating set (CDS) has been proposed as the virtual backbone to alleviate the broadcasting storm in wireless sensor network. Most recent research has extensively focused on the construction of connected dominating set. However, the nodes in the CDS need to dominate all its neighbors, and then some nodes cover a large number of neighboring nodes. Therefore, it is desirable to construct a capacitated dominating set, each node can dominate only a certain number of neighbors. In this paper, we study capacitated dominating set and connected capacitated dominating set, and propose two approximation algorithms with small approximation ratios. <\/jats:p>","DOI":"10.1142\/s1793830911000961","type":"journal-article","created":{"date-parts":[[2011,4,14]],"date-time":"2011-04-14T09:45:47Z","timestamp":1302774347000},"page":"9-15","source":"Crossref","is-referenced-by-count":3,"title":["ALGORITHMS FOR MINIMUM CONNECTED CAPACITATED DOMINATING SET PROBLEM"],"prefix":"10.1142","volume":"03","author":[{"given":"WEIPING","family":"SHANG","sequence":"first","affiliation":[{"name":"Department of Mathematics, Zhengzhou University, Zhengzhou 450001, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"XIUMEI","family":"WANG","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Zhengzhou University, Zhengzhou 450001, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2012,4,5]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1109\/JCN.2002.6596929"},{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1993.1047"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(99)00130-9"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1002\/wcm.356"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1023\/B:MONE.0000013625.87793.13"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.08.037"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830911000961","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T01:32:15Z","timestamp":1565141535000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830911000961"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,3]]},"references-count":6,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2012,4,5]]},"published-print":{"date-parts":[[2011,3]]}},"alternative-id":["10.1142\/S1793830911000961"],"URL":"https:\/\/doi.org\/10.1142\/s1793830911000961","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,3]]}}}