A linear-time algorithm for concave one-dimensional dynamic programming (Q909460): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Geometric applications of a matrix-searching algorithm / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Sequence comparison with mixed convex and concave costs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Speeding up dynamic programming with applications to molecular biology / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Least Weight Subsequence Problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3138930 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The concave least-weight subsequence problem revisited / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Speed-Up in Dynamic Programming / rank | |||
Normal rank |
Latest revision as of 13:31, 20 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A linear-time algorithm for concave one-dimensional dynamic programming |
scientific article |
Statements
A linear-time algorithm for concave one-dimensional dynamic programming (English)
0 references
1990
0 references
dynamic programming
0 references
quadrangle inequality
0 references
total monotonicity
0 references