Separating overlapped intervals on a line
DOI:
https://doi.org/10.20382/jocg.v10i1a11Abstract
Given n intervals on a line ℓ, we consider the problem of moving these intervals on ℓ such that after the movement no two intervals overlap and the maximum moving distance of the intervals is minimized. The difficulty for solving the problem lies in determining the order of the intervals in an optimal solution. By interesting observations, we show that it is sufficient to consider at most n “candidate” lists of ordered intervals. Further, although explicitly maintaining these lists takes Ω(n^2) time and space, by more observations and a pruning technique, we present an algorithm that can compute an optimal solution in O(n log n) time and O(n) space. We also prove an Ω(n log n) time lower bound for solving the problem, which implies the optimality of our algorithm.
Downloads
Downloads
Published
Issue
Section
License
Authors who publish with this journal agree to the following terms:
Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).