44 search results - page 1 / 9 » Distributed Approximation of Capacitated Dominating Sets |
MST
2010
13 years 3 months ago
2010
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
IPPS
2007
IEEE
14 years 2 months ago
2007
IEEE
PODC
2003
ACM
14 years 1 months ago
2003
ACM
COCOON
2007
Springer
14 years 2 months ago
2007
Springer
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 fam...
PODC
2010
ACM
14 years 13 days ago
2010
ACM
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...