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…