Constant round distributed domination on graph classes with bounded expansion

TL;DR

This paper demonstrates that the dominating set problem can be approximated within a constant factor in a fixed number of rounds in the LOCAL model for graph classes with bounded expansion, extending previous results.

Contribution

It generalizes existing work by providing a constant round approximation algorithm for bounded expansion graph classes, beyond graphs with excluded topological minors.

Findings

Constant factor approximation in constant rounds for bounded expansion graphs

Extension of previous results to broader graph classes

Generalization of distributed domination algorithms

Abstract

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.