331 search results - page 22 / 67 » Approximation Algorithms for Connected Dominating Sets |
152
Voted
MFCS
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. Bidimensionality provides a tool for developing subexponential fixed-parameter algorithms for combinatorial optimization problems on graph families that exclude a minor....
135
Voted
FOCS
2007
IEEE
15 years 9 months ago
2007
IEEE
We present a near-optimal reduction from approximately counting the cardinality of a discrete set to approximately sampling elements of the set. An important application of our wo...
129
Voted
SSS
2009
Springer
15 years 10 months ago
2009
Springer
We consider setting up sleep scheduling in sensor networks. We formulate the problem as an instance of the fractional domatic partition problem and obtain a distributed approximati...
164
Voted
MOBIHOC
2003
ACM
16 years 3 months ago
2003
ACM
The efficiency of a communication network depends not only on its control protocols, but also on its topology. We propose a distributed topology management algorithm that construc...
141
click to vote
SIGMETRICS
2010
ACM
15 years 8 months ago
2010
ACM
This paper addresses the problem of determining the node locations in ad-hoc sensor networks when only connectivity information is available. In previous work, we showed that the ...