Elsevier

Discrete Applied Mathematics

Volume 63, Issue 2, 17 November 1995, Pages 101-116
Discrete Applied Mathematics

Scheduling dyadic intervals

https://doi.org/10.1016/0166-218X(94)00068-OGet rights and content
Under a Creative Commons license
open archive

Abstract

We consider the problem of computing the shortest schedule of the intervals [j2i,(j + 1)2i), for 0 ⩽ j ⩽ 2i − 1 and 1 ⩽ ik such that separation of intersecting intervals is at least R. This problem arises in an application of wavelets to medical imaging. It is a generalization of the graph separation problem for the intersection graph of the intervals, which is to assign the numbers 1 to 2k + 1 − 2 to the vertices, other than the root, of a complete binary tree of height k in such a way as to maximize the minimum difference between all ancestor descendent pairs. We give an efficient algorithm to construct optimal schedules.

Cited by (0)