Consecutive interval query and dynamic programming on intervals

Abstract

Given a set of n points on a line and a set of m weighted intervals defined on these points, we consider a particular dynamic programming problem on these intervals. If the weights are all nonnegative or all nonpositive, we solve this dynamic programming problem efficiently by using matrix searching in Monge arrays, together with a new query data structure which we call the consecutive interval query structure. We invoke our algorithm to obtain fast algorithms for the sequential partition of a graph and for the partial clique covering of an interval graph.