98 search results - page 3 / 20 » Approximating minimum independent dominating sets in wireles... |
135
click to vote
ICDCS
2008
IEEE
15 years 6 months ago
2008
IEEE
In this paper, we study the problem of minimum connected dominating set in geometric k-disk graphs. This research is motivated by the problem of virtual backbone construction in w...
119
click to vote
MOBIHOC
2002
ACM
15 years 11 months ago
2002
ACM
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
110
click to vote
ADHOC
2005
14 years 11 months ago
2005
An ad hoc network is a multihop wireless communication network supporting mobile users. Network performance degradation is a major problem as the network becomes larger. Clusterin...
118
click to vote
ALGORITHMICA
1998
14 years 11 months ago
1998
The dominatingset problemin graphs asks for a minimumsize subset of vertices with the followingproperty: each vertex is required to either be in the dominating set, or adjacent to...
128
click to vote
MST
2010
14 years 6 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...