Back to search

Hosted by Utah State University Libraries

Minimizing Aggregate Movements for Interval Coverage

Abstract

dc:description.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.

Degree

thesis:*
Name thesis:degree_name
Master of Science (MS)
Level thesis:degree_level
Thesis
Discipline thesis:degree_discipline
Computer Science
Grantor dc:publisher
Hosted by Utah State University Libraries

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Andrews, Aaron M.
Contributors dc:contributor
  • Haitao Wang
  • Minghui Jiang
  • Vladimir Kulyukin

Subjects

dc:subject × 4

Identifiers

dc:identifier.*

Chain of custody

source
Harvested from
Utah State University
Base URL
digitalcommons.usu.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Andrews, Aaron M.. Minimizing Aggregate Movements for Interval Coverage. Thesis thesis, Hosted by Utah State University Libraries, https://digitalcommons.usu.edu/etd/3893