174 search results - page 6 / 35 » Connected dominating sets on dynamic geometric graphs |
190
click to vote
COCOON
2007
Springer
16 years 5 days 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...
197
click to vote
MOBIHOC
2002
ACM
16 years 5 months ago
2002
ACM
We present a series of approximation algorithms for finding a small weakly-connected dominating set (WCDS) in a given graph to be used in clustering mobile ad hoc networks. The st...
221
click to vote
MST
2010
15 years 23 days 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...