A tight local algorithm for the minimum dominating set problem in outerplanar graphs
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 …
algorithm) that finds a 5-approximation of a minimum dominating set on outerplanar graphs …
Local planar domination revisited
We show how to compute an (11+ ϵ)-approximation of a minimum dominating set in a
planar graph in a constant number of rounds in the LOCAL model of distributed computing …
planar graph in a constant number of rounds in the LOCAL model of distributed computing …
Deterministic CONGEST algorithm for MDS on bounded arboricity graphs
SA Amiri - arxiv preprint arxiv:2102.08076, 2021 - arxiv.org
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 …
dominating set on graphs of bounded arboricity in $ O (\log n) $ rounds. This improves over …
Distributed domination on sparse graph classes
O Heydt, S Kublenz, PO de Mendez, S Siebertz… - European Journal of …, 2025 - Elsevier
We show that the dominating set problem admits a constant factor approximation in a
constant number of rounds in the LOCAL model of distributed computing on graph classes …
constant number of rounds in the LOCAL model of distributed computing on graph classes …
Tight Bounds for Constant-Round Domination on Graphs of High Girth and Low Expansion
C Lenzen, S Wenning - … Symposium on Stabilizing, Safety, and Security of …, 2024 - Springer
A long-standing open question is which graph class is the most general one permitting
constant-time constant-factor approximations for dominating sets. The approximation ratio …
constant-time constant-factor approximations for dominating sets. The approximation ratio …
Bibliography of distributed approximation beyond bounded degree
L Feuilloley - arxiv preprint arxiv:2001.08510, 2020 - arxiv.org
This document is an informal bibliography of the papers dealing with distributed
approximation algorithms. A classic setting for such algorithms is bounded degree graphs …
approximation algorithms. A classic setting for such algorithms is bounded degree graphs …
Distributed Distance-r Covering Problems on Sparse High-Girth Graphs
S Akhoondian Amiri, B Wiederhake - International Conference on …, 2021 - Springer
We prove that the distance-r r dominating set, distance-r r connected dominating set,
distance-r r vertex cover, and distance-r r connected vertex cover problems admit constant …
distance-r r vertex cover, and distance-r r connected vertex cover problems admit constant …
Algorithmes distribués et dimension asymptotique
C Gavoille, T Picavet, A Wesolek - 26e Journées Graphes et … - jga2024.sciencesconf.org
Le modèle LOCALest un paradigme de calcul distribué où chaque sommet est un ordinateur
doté d'une puissance de calcul infinie, et où la communication se déroule de manière …
doté d'une puissance de calcul infinie, et où la communication se déroule de manière …
Trouver localement des petits ensembles dominants dans les graphes sans mineur K2, t
A Wesolek - Journées Graphes et Algorithmes 2023 - jga2023.sciencesconf.org
Le modèle LOCAL est un paradigme de calcul distribué où chaque sommet est considéré
comme un ordinateur doté d'une puissance de calcul infinie, et où la communication se …
comme un ordinateur doté d'une puissance de calcul infinie, et où la communication se …