{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T13:01:26Z","timestamp":1776258086250,"version":"3.50.1"},"reference-count":11,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2004,5,1]],"date-time":"2004-05-01T00:00:00Z","timestamp":1083369600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3364,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2004,5]]},"DOI":"10.1016\/s0166-218x(03)00368-8","type":"journal-article","created":{"date-parts":[[2003,9,12]],"date-time":"2003-09-12T03:43:33Z","timestamp":1063338213000},"page":"243-253","source":"Crossref","is-referenced-by-count":19,"title":["A distributed algorithm to find k-dominating sets"],"prefix":"10.1016","volume":"141","author":[{"given":"Lucia D","family":"Penso","sequence":"first","affiliation":[]},{"given":"Valmir C","family":"Barbosa","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(03)00368-8_BIB1","series-title":"An Introduction to Distributed Algorithms","author":"Barbosa","year":"1996"},{"key":"10.1016\/S0166-218X(03)00368-8_BIB2","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1006\/jagm.1993.1047","article-title":"How to allocate network centers","volume":"15","author":"Bar-Ilan","year":"1993","journal-title":"J. Algorithms"},{"key":"10.1016\/S0166-218X(03)00368-8_BIB3","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1137\/S0097539794261118","article-title":"A sub-linear time distributed algorithm for minimum-weight spanning trees","volume":"27","author":"Garay","year":"1998","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(03)00368-8_BIB4","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0166-218X(03)00368-8_BIB5","doi-asserted-by":"crossref","unstructured":"A.V. Goldberg, S.A. Plotkin, G.E. Shannon, Parallel symmetry-breaking in sparse graphs, in: Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, New York, NY, 1987, pp. 315\u2013324.","DOI":"10.1145\/28395.28429"},{"key":"10.1016\/S0166-218X(03)00368-8_BIB6","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1006\/jagm.1998.0929","article-title":"Fast distributed construction of small k-dominating sets and applications","volume":"28","author":"Kutten","year":"1998","journal-title":"J. Algorithms"},{"key":"10.1016\/S0166-218X(03)00368-8_BIB7","doi-asserted-by":"crossref","unstructured":"A. Panconesi, A. Srinivasan, Improved distributed algorithms for coloring and network decomposition problems, in: Proceedings of the Twenty-Fourth Annual ACM Symposium on Theory of Computing, New York, NY, 1992, pp. 581\u2013592.","DOI":"10.1145\/129712.129769"},{"key":"10.1016\/S0166-218X(03)00368-8_BIB8","doi-asserted-by":"crossref","unstructured":"D. Peleg, Distributed data structures: a complexity-oriented view, in: Proceedings of the Fourth International Workshop on Distributed Algorithms, 1991, pp. 71\u201389.","DOI":"10.1007\/3-540-54099-7_6"},{"key":"10.1016\/S0166-218X(03)00368-8_BIB9","doi-asserted-by":"crossref","first-page":"510","DOI":"10.1145\/65950.65953","article-title":"A tradeoff between size and efficiency for routing tables","volume":"36","author":"Peleg","year":"1989","journal-title":"J. ACM"},{"key":"10.1016\/S0166-218X(03)00368-8_BIB10","unstructured":"L.D. Penso, A distributed algorithm to find k-dominating sets in graphs, Master's Thesis, Federal University of Rio de Janeiro, December 1999 (in Portuguese)."},{"key":"10.1016\/S0166-218X(03)00368-8_BIB11","series-title":"Multicast Communication: Protocols and Applications","author":"Wittmann","year":"2001"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X03003688?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X03003688?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T22:27:19Z","timestamp":1551047239000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X03003688"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,5]]},"references-count":11,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2004,5]]}},"alternative-id":["S0166218X03003688"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(03)00368-8","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2004,5]]}}}