Date of Award:
5-2014
Document Type:
Thesis
Degree Name:
Master of Science (MS)
Department:
Computer Science
Committee Chair(s)
Haitao Wang
Committee
Haitao Wang
Committee
Minghui Jiang
Committee
Vladimir Kulyukin
Abstract
We present an efficient algorithm for solving an interval coverage problem. Given n intervals of the same length on a line L and a line segment B on L, we want to move the intervals along L such that every point of B is covered by at least one interval and the sum of the moving distances of all intervals is minimized. As a fundamental computational geometry problem, it has applications in mobile sensor barrier coverage in wireless sensor networks. The previous work gave an O(n2) time algorithm for it. In this thesis, by discovering many interesting observations and developing new algorithmic techniques, we present an O(n log n) time algorithm for this problem. We also show that Ω(n log n) is the lower bound for the time complexity. Therefore, our algorithm is optimal. Further, our observations and algorithmic techniques may be useful for solving other related problems.
Checksum
11e9b27bc1267e4eb89b8534dc8beb9c
Recommended Citation
Andrews, Aaron M., "Minimizing Aggregate Movements for Interval Coverage" (2014). All Graduate Theses and Dissertations, Spring 1920 to Summer 2023. 3893.
https://digitalcommons.usu.edu/etd/3893
Included in
Copyright for this work is retained by the student. If you have any questions regarding the inclusion of this work in the Digital Commons, please email us at .