DYNAMIC PROGRAMMING ON INTERVALS

DOI10.1142/S0218195993000208MaRDI QIDQ4294718zbMATH OpenOpenAlexFDO

Authors T. 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 graphdynamic programming on intervalsmaximum weight cliqueoptimal sequential partition of a graph

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1354129
• Consecutive interval query and dynamic programming on intervals
• Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs
• On the domatic number of interval graphs

Cited in

(6)

• Dynamic programming for free-time problems with endpoint constraints
• Consecutive interval query and dynamic programming on intervals
• Enhanced layered segment trees: a pragmatic data structure for real-time processing of geometric objects
• Dynamic optimization of interval narrowing algorithms
• scientific article; zbMATH DE number 1354129 (Why is no real title available?)
• Dynamic programming and inequalities

This page was built for publication: DYNAMIC PROGRAMMING ON INTERVALS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4294718)