We show that the dominating set problem admits a constant factor approximation in a constant number of rounds in the LOCAL model of distributed computing on graph classes with bounded expansion. This generalizes a result of Czygrinow et al. for graphs with excluded topological minors.

翻译：我们显示,占支配地位的既定问题在LOCAL模式中,在图表类分布式计算模式中,在连续数轮中以固定的系数近似值为恒定值,这种分布式计算模式具有边际扩张,它概括了Czygrinow等人对被排除在外的表层未成年人的图表的结果。