Published in: LIPIcs, Volume 246, 36th International Symposium on Distributed Computing (DISC 2022)
Sharareh Alipour and Mohammadhadi Salari. Brief Announcement: Distributed Algorithms for Minimum Dominating Set Problem and Beyond, a New Approach. In 36th International Symposium on Distributed Computing (DISC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 246, pp. 40:1-40:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{alipour_et_al:LIPIcs.DISC.2022.40, author = {Alipour, Sharareh and Salari, Mohammadhadi}, title = {{Brief Announcement: Distributed Algorithms for Minimum Dominating Set Problem and Beyond, a New Approach}}, booktitle = {36th International Symposium on Distributed Computing (DISC 2022)}, pages = {40:1--40:3}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-255-6}, ISSN = {1868-8969}, year = {2022}, volume = {246}, editor = {Scheideler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2022.40}, URN = {urn:nbn:de:0030-drops-172315}, doi = {10.4230/LIPIcs.DISC.2022.40}, annote = {Keywords: Minimum dominating set problem, set cover problem, k-distance dominating set problem, distributed algorithms} }
Feedback for Dagstuhl Publishing