{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T08:25:22Z","timestamp":1758270322184},"reference-count":23,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2009,12]]},"abstract":"<jats:p> A vertex set D of a connected graph G is a (k, r)-connected dominating set ((k, r)-CDS) if every vertex in V(G)\\D is at most r-hops away from at least k vertices in D. Finding a minimum (k, r)-CDS has wireless sensor network as its background. In this paper, we give two approximation algorithms to compute a minimum (k, r)-CDS, which improves previous works in regard of performance ratio. <\/jats:p>","DOI":"10.1142\/s1793830909000361","type":"journal-article","created":{"date-parts":[[2010,1,6]],"date-time":"2010-01-06T06:38:51Z","timestamp":1262759931000},"page":"485-498","source":"Crossref","is-referenced-by-count":25,"title":["TWO ALGORITHMS FOR CONNECTED r-HOP k-DOMINATING SET"],"prefix":"10.1142","volume":"01","author":[{"given":"ZHAO","family":"ZHANG","sequence":"first","affiliation":[{"name":"College of Mathematics and System Sciences, Xinjiang University, Urumqi, Xinjiang, 830046, P. R. China"}]},{"given":"QINGHAI","family":"LIU","sequence":"additional","affiliation":[{"name":"College of Mathematics and System Sciences, Xinjiang University, Urumqi, Xinjiang, 830046, P. R. China"}]},{"given":"DEYING","family":"LI","sequence":"additional","affiliation":[{"name":"School of Information, Renmin University of China, Beijing, 100872, P. R. China"}]}],"member":"219","published-online":{"date-parts":[[2012,4,5]]},"reference":[{"key":"rf1","first-page":"157","author":"Alzoubi K. M.","journal-title":"ACM Mobilhoc"},{"key":"rf3","unstructured":"J.\u00a0Blum, Handbook of Combinatorial Optimization, eds. D. Z.\u00a0Du and P.\u00a0Pardalos (Kluwer Academic Publishers, 2004)\u00a0pp. 329\u2013369."},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1002\/net.10097"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(90)90358-O"},{"key":"rf7","volume-title":"Introduction to Algorithms","author":"Cormen T. H.","year":"2002"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1109\/PROC.1987.13705"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1145\/1167935.1167941"},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1142\/S1793830909000105"},{"key":"rf12","author":"Gao X. F.","journal-title":"IEEE Trans. Mobile Comput"},{"key":"rf13","volume-title":"Computers and Intractability: a Guide to the Theory of NP-Completeness","author":"Garey M. R.","year":"1978"},{"key":"rf14","doi-asserted-by":"publisher","DOI":"10.1007\/BF01200845"},{"key":"rf15","doi-asserted-by":"publisher","DOI":"10.1007\/PL00009201"},{"key":"rf17","doi-asserted-by":"publisher","DOI":"10.1142\/S1793830909000087"},{"key":"rf18","doi-asserted-by":"publisher","DOI":"10.1002\/wcm.356"},{"key":"rf19","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-005-8466-1"},{"key":"rf20","doi-asserted-by":"publisher","DOI":"10.1023\/A:1023447105713"},{"key":"rf21","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2004.09.005"},{"key":"rf22","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.08.013"},{"key":"rf24","first-page":"505","volume":"5","author":"Spohn M. A.","journal-title":"Ad Hoc Netw."},{"key":"rf27","doi-asserted-by":"publisher","DOI":"10.1142\/S1793830909000221"},{"key":"rf28","first-page":"1","volume":"21","author":"Wegner G.","journal-title":"Studia Sci. Math. Hungar."},{"key":"rf29","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.08.037"},{"key":"rf30","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-008-9384-9"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830909000361","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T11:53:50Z","timestamp":1565178830000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830909000361"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,12]]},"references-count":23,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2012,4,5]]},"published-print":{"date-parts":[[2009,12]]}},"alternative-id":["10.1142\/S1793830909000361"],"URL":"https:\/\/doi.org\/10.1142\/s1793830909000361","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,12]]}}}