Abstract
In this paper, we study an interval coverage problem. We are given n intervals of the same length on a line L and a line segment B on L. Each interval has a nonnegative weight. The goal is to move the intervals along L such that every point of B is covered by at least one interval and the maximum moving cost of all intervals is minimized, where the moving cost of each interval is its moving distance times its weight. Algorithms for the “unweighted” version of this problem have been given before. In this paper, we present a first-known algorithm for this weighted version and our algorithm runs in O(n2 log n log log n) time. The problem has applications in mobile sensor barrier coverage.
Cite
CITATION STYLE
Wang, H., & Zhang, X. (2015). Minimizing the maximum moving cost of interval coverage. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9472, pp. 188–198). Springer Verlag. https://doi.org/10.1007/978-3-662-48971-0_17
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
