Abstract
We study a one-dimensional sensor cover problem, known as the Restricted Strip Cover (RSC) problem, defined as follows. We are given an interval U of the real line, and a set of n sensors, each of which covers some subinterval of U and is powered with a battery of limited duration. The RSC problem consists in assigning a starting time to each sensor so that the whole interval U is covered for as long as possible. We assume that when a sensor is turned on (at its starting time) it remains on through the duration of its battery.
Buchsbaum, Efrat, Jain, Venkatasubramanian and Yi showed that RSC is NP-hard and designed an O(loglogn)-approximation algorithm. More recently, Gibson and Varadarajan presented a greedy-like algorithm which they proved to have approximation ratio at most 5. We prove that the approximation ratio of this algorithm is 4, and exhibit an instance showing that this ratio is tight. We also show an integer programming formulation for this problem and present some computational results obtained with the implementation of this approach. For the same set of instances, we compute the quality of the solution found by the approximation algorithm.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Buchsbaum, A.L., Efrat, A., Jain, S., Venkatasubramanian, S., Yi, K.: Restricted strip covering and the sensor cover problem. In: Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA ), pp. 1056–1063 (2007)
Buchsbaum, A.L., Efrat, A., Jain, S., Venkatasubramanian, S., Yi, K.: Restricted strip covering and the sensor cover problem. E-print from 2008 submitted to the arXiv: http://arxiv.org/pdf/cs/0605102
Gibson, M., Varadarajan, K.: Decomposing coverings and the planar sensor cover problem. In: Proceeding of the 50th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2009), pp. 159–168 (2009)
Buchsbaum, A.L., Karloff, H., Kenyon, C., Reingold, N., Thorup, M.: OPT versus LOAD in dynamic storage allocation. SIAM Journal of Computing 33(3), 632–646 (2004)
Garey, M., Johnson, D.: Computers and Intractability: a Guide to the Theory of NP-Completeness. Freeman (1979)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
da Ponte Barbosa, R., Wakabayashi, Y. (2012). A Better Approximation Ratio and an IP Formulation for a Sensor Cover Problem. In: Fernández-Baca, D. (eds) LATIN 2012: Theoretical Informatics. LATIN 2012. Lecture Notes in Computer Science, vol 7256. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29344-3_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-29344-3_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-29343-6
Online ISBN: 978-3-642-29344-3
eBook Packages: Computer ScienceComputer Science (R0)