Sciweavers

370 search results - page 30 / 74
» Improved Approximation Algorithms for Connected Sensor Cover
Sort
View
ICDT
2005
ACM
128views Database» more  ICDT 2005»
15 years 3 months ago
The Pipelined Set Cover Problem
Abstract. A classical problem in query optimization is to find the optimal ordering of a set of possibly correlated selections. We provide an ion of this problem as a generalizati...
Kamesh Munagala, Shivnath Babu, Rajeev Motwani, Je...
WINET
2008
86views more  WINET 2008»
14 years 9 months ago
Relay sensor placement in wireless sensor networks
This paper addresses the following relay sensor placement problem: given the set of duty sensors in the plane and the upper bound of the transmission range, compute the minimum nu...
Xiuzhen Cheng, Ding-Zhu Du, Lusheng Wang, Baogang ...
CORR
2011
Springer
192views Education» more  CORR 2011»
14 years 4 months ago
Improved Approximation Guarantees for Lower-Bounded Facility Location
d Abstract) Sara Ahmadian∗ Chaitanya Swamy∗ We consider the lower-bounded facility location (LBFL) problem (also sometimes called load-balanced facility location), which is a ...
Sara Ahmadian, Chaitanya Swamy
ADHOCNETS
2009
Springer
15 years 4 months ago
Improved Topology Control Algorithms for Simple Mobile Networks
Topology control is the problem of assigning powers to the nodes of an ad hoc network so as to create a specified network topology while minimizing the energy consumed by the netw...
Fei Che, Errol L. Lloyd, Liang Zhao
ICDCS
2006
IEEE
15 years 3 months ago
Self-Protection for Wireless Sensor Networks
Wireless sensor networks have recently been suggested for many surveillance applications such as object monitoring, path protection, or area coverage. Since the sensors themselves...
Dan Wang, Qian Zhang, Jiangchuan Liu