Near-optimal distributed dominating set in bounded arboricity graphs
{{output}}
We describe a simple deterministic O ( ε - 1 log Δ ) round distributed algorithm for ( 2 α + 1 ) ( 1 + ε ) approximation of minimum weighted dominating set on graphs with arboricity at most α . Here Δ denotes the maximum degree... ...
