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