2 papers
cs.DM2022
Distributed domination on sparse graph classes
Ozan Heydt, Simeon Kublenz, Patrice Ossona de Mendez +2
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 with boun…
cs.DC2021
Local planar domination revisited
Ozan Heydt, Sebastian Siebertz, Alexandre Vigny
We show how to compute a 20-approximation of a minimum dominating set in a planar graph in a constant number of rounds in the LOCAL model of distributed computing. This improves on…