Sciweavers

Share
44 search results - page 1 / 9
» Distributed Approximation of Capacitated Dominating Sets
Sort
View
MST
2010
187views more  MST 2010»
8 years 5 months ago
Distributed Approximation of Capacitated Dominating Sets
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
Fabian Kuhn, Thomas Moscibroda
COCOON
2007
Springer
9 years 4 months ago
Distributed Approximation Algorithms for Weighted Problems in Minor-Closed Families
We give eļ¬ƒcient distributed approximation algorithms for weighted versions of the maximum matching problem and the minimum dominating set problem for graphs from minor-closed fam...
Andrzej Czygrinow, Michal Hanckowiak
PODC
2010
ACM
9 years 2 months ago
Distributed algorithms for edge dominating sets
An edge dominating set for a graph G is a set D of edges such that each edge of G is in D or adjacent to at least one edge in D. This work studies deterministic distributed approx...
Jukka Suomela
books