331 search results - page 8 / 67 » Approximation Algorithms for Connected Dominating Sets |
101
Voted
SNPD
2007
15 years 1 months ago
2007
Source and destination location privacy is a challenging and important problem in sensor networks. Nevertheless, privacy preserving communication in sensor networks is still a vir...
108
Voted
COLOGNETWENTE
2007
15 years 1 months ago
2007
We present the first polynomial-time approximation scheme (PTAS) for the Minimum Independent Dominating Set problem in graphs of polynomially bounded growth. Graphs of bounded gr...
112
click to vote
WDAG
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. Since in general it is NP-hard to solve the minimum dominating set problem even approximatively, a lot of work has been dedicated to central and distributed approximation...
95
Voted
IPL
2008
14 years 11 months ago
2008
A problem open for many years is whether there is an FPT algorithm that given a graph G and parameter k, either: (1) determines that G has no k-Dominating Set, or (2) produces a do...
131
click to vote
PODC
2010
ACM
15 years 3 months 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...