16 search results - page 2 / 4 » The first constant factor approximation for minimum partial ... |
CCCG
2010
13 years 6 months ago
2010
A dominating set of a graph G = (V, E) is a subset V V of the nodes such that for all nodes v V , either v V or a neighbor u of v is in V . Several routing protocols in ad hoc ...
ALGORITHMICA
1998
13 years 5 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...
MST
2010
13 years 3 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...
JCIT
2008
13 years 5 months ago
2008
Many prominent applications in wireless sensor networks require collected information has to be routed to end nodes in an efficient manner. In general, Connected Dominating Set (C...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
A local algorithm is a distributed algorithm that completes after a constant number of synchronous communication rounds. We present local approximation algorithms for the minimum ...