Deterministic CONGEST Algorithm for MDS on Bounded Arboricity Graphs

We provide a deterministic CONGEST algorithm to constant factor approximate the minimum dominating set on graphs of bounded arboricity in $O(\log n)$ rounds. This improves over the well-known randomized algorithm of Lenzen and Wattenhofer[DISC2010] by making it a deterministic algorithm.

Saved in:

Bibliographic Details
Main Author:	Amiri, Saeed Akhoondian
Format:	Journal Article
Language:	English
Published:	16-02-2021
Subjects:	Computer Science - Data Structures and Algorithms Computer Science - Distributed, Parallel, and Cluster Computing
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	We provide a deterministic CONGEST algorithm to constant factor approximate the minimum dominating set on graphs of bounded arboricity in $O(\log n)$ rounds. This improves over the well-known randomized algorithm of Lenzen and Wattenhofer[DISC2010] by making it a deterministic algorithm.
DOI:	10.48550/arxiv.2102.08076