Sciweavers

370 search results - page 1 / 74
» Improved Approximation Algorithms for Connected Sensor Cover
Sort
View
ADHOCNOW
2004
Springer
13 years 11 months ago
Improved Approximation Algorithms for Connected Sensor Cover
Stefan Funke, Alexander Kesselman, Zvi Lotker, Mic...
MOBIHOC
2003
ACM
14 years 5 months ago
Connected sensor cover: self-organization of sensor networks for efficient query execution
Spatial query execution is an essential functionality of a sensor network, where a query gathers sensor data within a specific geographic region. Redundancy within a sensor networ...
Himanshu Gupta, Samir R. Das, Quinyi Gu
FOCS
2009
IEEE
14 years 5 days ago
Decomposing Coverings and the Planar Sensor Cover Problem
We show that a k-fold covering using translates of an arbitrary convex polygon can be decomposed into Omega(k) covers (using an efficient algorithm). We generalize this result to ...
Matt Gibson, Kasturi R. Varadarajan
APPROX
2000
Springer
190views Algorithms» more  APPROX 2000»
13 years 9 months ago
Approximating node connectivity problems via set covers
Given a graph (directed or undirected) with costs on the edges, and an integer k, we consider the problem of nding a k-node connected spanning subgraph of minimum cost. For the ge...
Guy Kortsarz, Zeev Nutov
DEXA
2009
Springer
153views Database» more  DEXA 2009»
13 years 9 months ago
Three Approximation Algorithms for Energy-Efficient Query Dissemination in Sensor Database System
Abstract. Sensor database is a type of database management system which offers sensor data and stored data in its data model and query languages. In this system, when a user poses ...
Zhao Zhang, Xiaofeng Gao, Xuefei Zhang, Weili Wu, ...