License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.DISC.2022.40
URN: urn:nbn:de:0030-drops-172315
URL: https://drops.dagstuhl.de/opus/volltexte/2022/17231/
Go to the corresponding LIPIcs Volume Portal


Alipour, Sharareh ; Salari, Mohammadhadi

Brief Announcement: Distributed Algorithms for Minimum Dominating Set Problem and Beyond, a New Approach

pdf-format:
LIPIcs-DISC-2022-40.pdf (0.5 MB)


Abstract

In this paper, we study the minimum dominating set (MDS) problem and the minimum total dominating set (MTDS) problem. We propose a new idea to compute approximate MDS and MTDS. This new approach can be implemented in a distributed model or parallel model. We also show how to use this new approach in other related problems such as set cover problem and k-distance dominating set problem.

BibTeX - Entry

@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/opus/volltexte/2022/17231},
  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}
}

Keywords: Minimum dominating set problem, set cover problem, k-distance dominating set problem, distributed algorithms
Collection: 36th International Symposium on Distributed Computing (DISC 2022)
Issue Date: 2022
Date of publication: 17.10.2022


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI