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…