Sciweavers

2571 search results - page 1 / 515
» Approximation schemes for wireless networks
Sort
View
52
Voted
TALG
2008
70views more  TALG 2008»
14 years 10 months ago
Approximation schemes for wireless networks
Tim Nieberg, Johann Hurink, Walter Kern
PODC
2006
ACM
15 years 4 months ago
Local approximation schemes for topology control
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...
Mirela Damian, Saurav Pandit, Sriram V. Pemmaraju
TPDS
2008
120views more  TPDS 2008»
14 years 10 months ago
A New Storage Scheme for Approximate Location Queries in Object-Tracking Sensor Networks
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...
Jianliang Xu, Xueyan Tang, Wang-Chien Lee
JCO
2010
182views more  JCO 2010»
14 years 9 months ago
Polynomial time approximation schemes for minimum disk cover problems
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...
Chen Liao, Shiyan Hu
COLOGNETWENTE
2007
14 years 12 months ago
Approximating minimum independent dominating sets in wireless networks
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...
Johann Hurink, Tim Nieberg