370 search results - page 13 / 74 » Improved Approximation Algorithms for Connected Sensor Cover |
FOCS
2006
IEEE
14 years 1 months ago
2006
IEEE
In this paper we introduce a new general framework for set covering problems, based on the combination of randomized rounding of the (near-)optimal solution of the Linear Programm...
ICRA
2007
IEEE
14 years 1 months ago
2007
IEEE
Abstract Minimizing the energy consumption of target tracking using a mobile sensor network is proved to be NPcomplete. Based on proximity graph, an approximately optimal solution ...
TCC
2007
Springer
14 years 1 months ago
2007
Springer
Private approximation of search problems deals with finding approximate solutions to search problems while disclosing as little information as possible. The focus of this work is ...
JCO
2007
13 years 7 months ago
2007
Let G = (V, E) be a connected multigraph, whose edges are associated with labels specified by an integer-valued function L : E → N. In addition, each label ℓ ∈ N has a non-...
ALGOSENSORS
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. We consider the self-deployment problem in a ring for a network of identical sensors: starting from some initial random placement in the ring, the sensors in the network ...