LIPIcs.DISC.2022.40.pdf
- Filesize: 493 kB
- 3 pages
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.
Feedback for Dagstuhl Publishing