2571 search results - page 1 / 515 » Approximation schemes for wireless networks |
52
Voted
TALG
2008
14 years 10 months ago
2008
PODC
2006
ACM
15 years 4 months ago
2006
ACM
This paper presents a distributed algorithm for wireless adhoc networks that runs in polylogarithmic number of rounds in the size of the network and constructs a lightweight, line...
TPDS
2008
14 years 10 months ago
2008
Energy efficiency is one of the most critical issues in the design of wireless sensor networks. Observing that many sensor applications for object tracking can tolerate a certain d...
JCO
2010
14 years 9 months ago
2010
The following planar minimum disk cover problem is considered in this paper: given a set D of n disks and a set P of m points in the Euclidean plane, where each disk covers a subse...
101
click to vote
COLOGNETWENTE
2007
14 years 12 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...