Distributed algorithms for weighted problems in minor-closed families
Andrzej Czygrinow · 2007
We give efficient distributed algorithms for weighted versions of the maximum matching problem and the minimum dominating set problem for graphs from minor-closed families. To complement these results we argue that no efficient distributed algorithm for the minimum weight connected dominating set exists.