Approximation schemes for covering and packing problems in image processing and VLSI
Journal of the ACM (JACM)
Faster and Simpler Algorithms for Multicommodity Flow and other Fractional Packing Problems.
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Approximation algorithms for NP-complete problems on planar graphs
SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
Design and Analysis of Approximation Algorithms
Design and Analysis of Approximation Algorithms
Constructing weakly connected dominating set for secure clustering in distributed sensor network
Journal of Combinatorial Optimization
Sensors: Theory, Algorithms, and Applications
Sensors: Theory, Algorithms, and Applications
A (4+ε)-approximation for the minimum-weight dominating set problem in unit disk graphs
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
Constant-factor approximation for minimum-weight (connected) dominating sets in unit disk graphs
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Hi-index | 0.00 |
A sensor with two active phrases means that active mode has two phases, the full-active phase and the semi-active phase, which require different energy consumptions. A full-active sensor can sense data packets, transmit, receive, and relay the data packets. A semi-active sensor cannot sense data packets, but it can transmit, receive, and relay data packets. Given a set of targets and a set of sensors with two active phrases, find a sleep/active schedule of sensors to maximize the time period during which active sensors form a connected coverage set. In this paper, this problem is showed to have polynomial-time $${(7.875+\varepsilon)}$$ -approximations for any $${\varepsilon 0 }$$ when all targets and sensors lie in the Euclidean plane and all sensors have the same sensing radius R s and the same communication radius R c with R c 驴 2R s .