Consecutive interval query and dynamic programming on intervals

Alok Aggarwal; Takeshi Tokuyama

doi:10.1016/S0166-218X(98)00021-3

Consecutive interval query and dynamic programming on intervals

Alok Aggarwal, Takeshi Tokuyama

INF - System Information Sciences

Research output: Contribution to journal › Article › peer-review

1 Citation (Scopus)

Abstract

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 language	English
Pages (from-to)	1-24
Number of pages	24
Journal	Discrete Applied Mathematics
Volume	85
Issue number	1
DOIs	https://doi.org/10.1016/S0166-218X(98)00021-3
Publication status	Published - 1998 Jun 1

Keywords

Clique covering
Dynamic programming
Interval query
Matrix searching
Sequential partition

ASJC Scopus subject areas

Discrete Mathematics and Combinatorics
Applied Mathematics

Access to Document

10.1016/S0166-218X(98)00021-3

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

Cite this

@article{f1cd50d83d4b4197b9496af0667d2b73,

title = "Consecutive interval query and dynamic programming on intervals",

abstract = "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.",

keywords = "Clique covering, Dynamic programming, Interval query, Matrix searching, Sequential partition",

author = "Alok Aggarwal and Takeshi Tokuyama",

year = "1998",

month = jun,

day = "1",

doi = "10.1016/S0166-218X(98)00021-3",

language = "English",

volume = "85",

pages = "1--24",

journal = "Discrete Applied Mathematics",

issn = "0166-218X",

publisher = "Elsevier",

number = "1",

}

TY - JOUR

T1 - Consecutive interval query and dynamic programming on intervals

AU - Aggarwal, Alok

AU - Tokuyama, Takeshi

PY - 1998/6/1

Y1 - 1998/6/1

N2 - 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.

AB - 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.

KW - Clique covering

KW - Dynamic programming

KW - Interval query

KW - Matrix searching

KW - Sequential partition

UR - http://www.scopus.com/inward/record.url?scp=0040716241&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0040716241&partnerID=8YFLogxK

U2 - 10.1016/S0166-218X(98)00021-3

DO - 10.1016/S0166-218X(98)00021-3

M3 - Article

AN - SCOPUS:0040716241

VL - 85

SP - 1

EP - 24

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

SN - 0166-218X

IS - 1

ER -