A tight local algorithm for the minimum dominating set problem in outerplanar graphs

08/05/2021
by   Marthe Bonamy, et al.
0

We show that there is a deterministic local algorithm (constant-time distributed graph algorithm) that finds a 5-approximation of a minimum dominating set on outerplanar graphs. We show there is no such algorithm that finds a (5-ε)-approximation, for any ε>0. Our algorithm only requires knowledge of the degree of a vertex and of its neighbors, so that large messages and unique identifiers are not needed.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/26/2019

Deterministic Distributed Dominating Set Approximation in the CONGEST Model

We develop deterministic approximation algorithms for the minimum domina...
research
03/07/2022

Distributed distance domination in graphs with no K_2,t-minor

We prove that a simple distributed algorithm finds a constant approximat...
research
05/30/2023

On the Approximability of External-Influence-Driven Problems

Domination problems in general can capture situations in which some enti...
research
02/16/2021

Deterministic CONGEST Algorithm for MDS on Bounded Arboricity Graphs

We provide a deterministic CONGEST algorithm to constant factor approxim...
research
12/09/2020

On Distributed Algorithms for Minimum Dominating Set problem, from theory to application

In this paper, we propose a distributed algorithm for the minimum domina...
research
02/17/2020

Finding All Global Minimum Cuts In Practice

We present a practically efficient algorithm that finds all global minim...
research
08/12/2020

The Italian bondage and reinforcement numbers of digraphs

An Italian dominating function on a digraph D with vertex set V(D) is de...

Please sign up or login with your details

Forgot password? Click here to reset