Sciweavers

Share
COCOON
2007
Springer

Distributed Approximation Algorithms for Weighted Problems in Minor-Closed Families

9 years 2 months ago
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.
Andrzej Czygrinow, Michal Hanckowiak
Added 07 Jun 2010
Updated 07 Jun 2010
Type Conference
Year 2007
Where COCOON
Authors Andrzej Czygrinow, Michal Hanckowiak
Comments (0)
books