• Brief Announcement: Distribute...

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

Title:
Brief Announcement: Distributed Algorithms for Minimum Dominating Set Problem and Beyond, a New Approach
Authors:
Alipour, Sharareh, Salari, Mohammadhadi
Contributors:
Sharareh Alipour and Mohammadhadi Salari
Publisher Information:
Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022.
Publication Year:
2022
Subject Terms:
distributed algorithms, Minimum dominating set problem, ddc:004, set cover problem, k-distance dominating set problem
Document Type:
Konferenz Conference object<br />Article
File Description:
application/pdf
Language:
English
DOI:
10.4230/lipics.disc.2022.40
Access URL:
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2022.40
Rights:
CC BY
Accession Number:
edsair.dedup.wf.002..351a0fd782973a3758f5b950cc90df8c
Database:
OpenAIRE

Weitere Informationen

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.