Distributed Approximation Algorithms for Weighted Problems in Minor-Closed Families

We give efficient distributed approximation 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 indicate that no efficient distributed algorithm for the minimum weight connected dominating set exists.

• Type: Conference
• Year: 2007
• Where: COCOON
• Authors: Andrzej Czygrinow, Michal Hanckowiak
• Keywords: COCOON 2007, Connected Dominating Set, Dominating Set, Minimum Dominating Set