370 search results - page 24 / 74 » Improved Approximation Algorithms for Connected Sensor Cover |
SODA
2012
ACM
11 years 11 months ago
2012
ACM
We give a deterministic O(log n)n -time and space algorithm for the Shortest Vector Problem (SVP) of a lattice under any norm, improving on the previous best deterministic nO(n) -...
COCOON
2005
Springer
14 years 2 months ago
2005
Springer
The paper addresses the relay node placement problem in two-tiered wireless sensor networks. Given a set of sensor nodes in an Euclidean plane, our objective is to place minimum nu...
PERCOM
2009
ACM
14 years 3 months ago
2009
ACM
—One of the major issues in a wireless sensor network (WSN) is how to cover an interested area. In this paper, we consider the area coverage problem for variable sensing radii WS...
ANTSW
2006
Springer
14 years 8 days ago
2006
Springer
Abstract. For solving combinatorial optimisation problems, exact methods accurately exploit the structure of the problem but are tractable only up to a certain size; approximation ...
APPROX
2010
Springer
13 years 10 months ago
2010
Springer
Abstract. We provide improved approximation algorithms for the minmax generalization problems considered by Du, Eppstein, Goodrich, and Lueker [1]. In min-max generalization proble...