Consecutive interval query and dynamic programming on intervals

Alok Aggarwal; Takeshi Tokuyama

doi:10.1007/3-540-57568-5_278

Consecutive interval query and dynamic programming on intervals

Alok Aggarwal, Takeshi Tokuyama

INF - System Information Sciences

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

3 Citations (Scopus)

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.

Original language	English
Title of host publication	Algorithms and Computation - 4th International Symposium, ISAAC 1993, Proceedings
Editors	Kam Wing Ng, Prabhakar Raghavan, N.V. Balasubramanian, Francis Y.L. Chin
Publisher	Springer Verlag
Pages	466-475
Number of pages	10
ISBN (Print)	9783540575689
DOIs	https://doi.org/10.1007/3-540-57568-5_278
Publication status	Published - 1993
Event	4th International Symposium on Algorithms and Computation, ISAAC 1993 - Hong Kong, China Duration: 1993 Dec 15 → 1993 Dec 17

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	762 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	4th International Symposium on Algorithms and Computation, ISAAC 1993
Country	China
City	Hong Kong
Period	93/12/15 → 93/12/17

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/3-540-57568-5_278

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

Cite this

Aggarwal, A., & Tokuyama, T. (1993). Consecutive interval query and dynamic programming on intervals. In K. W. Ng, P. Raghavan, N. V. Balasubramanian, & F. Y. L. Chin (Eds.), Algorithms and Computation - 4th International Symposium, ISAAC 1993, Proceedings (pp. 466-475). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 762 LNCS). Springer Verlag. https://doi.org/10.1007/3-540-57568-5_278

Consecutive interval query and dynamic programming on intervals. / Aggarwal, Alok; Tokuyama, Takeshi.

Algorithms and Computation - 4th International Symposium, ISAAC 1993, Proceedings. ed. / Kam Wing Ng; Prabhakar Raghavan; N.V. Balasubramanian; Francis Y.L. Chin. Springer Verlag, 1993. p. 466-475 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 762 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Aggarwal, A & Tokuyama, T 1993, Consecutive interval query and dynamic programming on intervals. in KW Ng, P Raghavan, NV Balasubramanian & FYL Chin (eds), Algorithms and Computation - 4th International Symposium, ISAAC 1993, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 762 LNCS, Springer Verlag, pp. 466-475, 4th International Symposium on Algorithms and Computation, ISAAC 1993, Hong Kong, China, 93/12/15. https://doi.org/10.1007/3-540-57568-5_278

Aggarwal A, Tokuyama T. Consecutive interval query and dynamic programming on intervals. In Ng KW, Raghavan P, Balasubramanian NV, Chin FYL, editors, Algorithms and Computation - 4th International Symposium, ISAAC 1993, Proceedings. Springer Verlag. 1993. p. 466-475. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/3-540-57568-5_278

Aggarwal, Alok ; Tokuyama, Takeshi. / Consecutive interval query and dynamic programming on intervals. Algorithms and Computation - 4th International Symposium, ISAAC 1993, Proceedings. editor / Kam Wing Ng ; Prabhakar Raghavan ; N.V. Balasubramanian ; Francis Y.L. Chin. Springer Verlag, 1993. pp. 466-475 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{6f398785f9a6469e8e5d84ed5951ef08,

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

author = "Alok Aggarwal and Takeshi Tokuyama",

year = "1993",

doi = "10.1007/3-540-57568-5_278",

language = "English",

isbn = "9783540575689",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "466--475",

editor = "Ng, {Kam Wing} and Prabhakar Raghavan and N.V. Balasubramanian and Chin, {Francis Y.L.}",

booktitle = "Algorithms and Computation - 4th International Symposium, ISAAC 1993, Proceedings",

note = "4th International Symposium on Algorithms and Computation, ISAAC 1993 ; Conference date: 15-12-1993 Through 17-12-1993",

}

TY - GEN

T1 - Consecutive interval query and dynamic programming on intervals

AU - Aggarwal, Alok

AU - Tokuyama, Takeshi

PY - 1993

Y1 - 1993

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

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

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

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

U2 - 10.1007/3-540-57568-5_278

DO - 10.1007/3-540-57568-5_278

M3 - Conference contribution

AN - SCOPUS:84936674337

SN - 9783540575689

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 466

EP - 475

BT - Algorithms and Computation - 4th International Symposium, ISAAC 1993, Proceedings

A2 - Ng, Kam Wing

A2 - Raghavan, Prabhakar

A2 - Balasubramanian, N.V.

A2 - Chin, Francis Y.L.

PB - Springer Verlag

T2 - 4th International Symposium on Algorithms and Computation, ISAAC 1993

Y2 - 15 December 1993 through 17 December 1993

ER -