Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

111

Voted

ADHOCNOW
2004
Springer

95views Computer Networks» more ADHOCNOW 2004»

Improved Approximation Algorithms for Connected Sensor Cover

15 years 8 months ago

Improved Approximation Algorithms for Connected Sensor Cover

Download delivery.acm.org

Stefan Funke, Alexander Kesselman, Zvi Lotker, Mic

Real-time Traffic

ADHOCNOW 2004 | Wireless Networks |

claim paper

Related Content

» Connected sensor cover selforganization of sensor networks for efficient query execution

» Decomposing Coverings and the Planar Sensor Cover Problem

» Approximating node connectivity problems via set covers

» Three Approximation Algorithms for EnergyEfficient Query Dissemination in Sensor Database ...

» On Connected Multiple Point Coverage in Wireless Sensor Networks

» Deploying Directional Sensor Networks with Guaranteed Connectivity and Coverage

» Vertex and Edge Covers with Clustering Properties Complexity and Algorithms

» A Distributed Energy Efficient Query Processing in SelfOrganized Wireless Sensor Networks

» A Distributed Greedy Algorithm for Connected Sensor Cover in Dense Sensor Networks

Post Info
More Details (n/a)

Added	30 Jun 2010
Updated	30 Jun 2010
Type	Conference
Year	2004
Where	ADHOCNOW
Authors	Stefan Funke, Alexander Kesselman, Zvi Lotker, Michael Segal

Comments (0)