Deterministic CONGEST Algorithm for MDS on Bounded Arboricity Graphs

We provide a deterministic CONGEST algorithm to constant factor approximate the minimum dominating set on graphs of bounded arboricity in $O(\log\Delta)$ rounds. This improves over the well-known randomized algorithm of Lenzen and Wattenhofer[DISC2010] in two ways: it is deterministic and the logarithmic factor depends only on the maximum degree $\Delta$, not the number of vertices $n$.