A linear-time algorithm for concave one-dimensional dynamic programming
Open Access
- 1 February 1990
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 33 (6) , 309-311
- https://doi.org/10.1016/0020-0190(90)90215-j
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Speeding up dynamic programming with applications to molecular biologyTheoretical Computer Science, 1989
- The concave least-weight subsequence problem revisitedJournal of Algorithms, 1988
- Geometric applications of a matrix-searching algorithmAlgorithmica, 1987
- The Least Weight Subsequence ProblemSIAM Journal on Computing, 1987
- Speed-Up in Dynamic ProgrammingSIAM Journal on Algebraic Discrete Methods, 1982