DYNAMIC PROGRAMMING ON INTERVALS

DOI10.1142/S0218195993000208zbMath0804.90130OpenAlexW2110399462MaRDI QIDQ4294718

Takao Asano

Publication date: 18 May 1994

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218195993000208

zbMATH Keywords

circular-arc graphmaximum weight cliquedynamic programming on intervalsoptimal sequential partition of a graph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Dynamic programming (90C39)

Related Items (2)

Consecutive interval query and dynamic programming on intervals ⋮ Enhanced layered segment trees: a pragmatic data structure for real-time processing of geometric objects

This page was built for publication: DYNAMIC PROGRAMMING ON INTERVALS