Consecutive interval query and dynamic programming on intervals

Alok Aggarwal, Takeshi Tokuyama

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)


Given a set of n points (nodes) on a line and a set of m weighted intervals defined on the nodes, we consider a particular dynamic programming (DP) problem on these intervals. If the weight function of the DP has convex or concave property, we can solve this DP problem efficiently by using matrix searching in Monge matrices, together with a new query data structure, which we call the consecutive query structure. We invoke our algorithm to obtain fast algorithms for sequential partition of a graph and for maximum K-clique of an interval graph.

Original languageEnglish
Pages (from-to)1-24
Number of pages24
JournalDiscrete Applied Mathematics
Issue number1
Publication statusPublished - 1998 Jun 1


  • Clique covering
  • Dynamic programming
  • Interval query
  • Matrix searching
  • Sequential partition

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics


Dive into the research topics of 'Consecutive interval query and dynamic programming on intervals'. Together they form a unique fingerprint.

Cite this