Abstract
We investigate dynamic algorithms for the interval scheduling problem. We focus on the case when the set of intervals is monotonic. This is when no interval properly contains another interval. We provide two data structures for representing the intervals that allow efficient insertion, removal and various query operations. The first dynamic algorithm, based on the data structure called compatibility forest, runs in amortised time O(log2n) for insertion and removal and O(logn) for query. The second dynamic algorithm, based on the data structure called linearised tree, runs in time O(logn) for insertion, removal and query. We discuss differences and similarities of these two data structures through theoretical and experimental results.