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.

翻译：我们提供了一种决定性的CONEEST算法,其常数系数大约为美元(log n)圆轮内接合偏差图上的最低支配值。 这改善了众所周知的Lenzen和Wattenhofer的随机算法[DISC2010],使其成为一种确定性算法。