Separating overlapped intervals on a line

Abstract

Given n intervals on a line l, we consider the problem of moving these intervals on l 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.