Distributed distance domination in graphs with no $K_{2,t}$-minor

Andrzej Czygrinow, Michał Hanćkowiak, Marcin Witkowski

We prove that a simple distributed algorithm finds a constant approximation of an optimal distance-$k$ dominating set in graphs with no $K_{2,t}$-minor. The algorithm runs in a con…