Online dynamic programming speedups
From MaRDI portal
Publication:839641
DOI10.1007/s00224-009-9166-xzbMath1170.90512OpenAlexW2046367228MaRDI QIDQ839641
Mordecai J. Golin, Amotz Bar-Noy, Yan Zhang
Publication date: 2 September 2009
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-009-9166-x
Related Items (2)
Computing a Hamiltonian path of minimum Euclidean length inside a simple polygon ⋮ A new effective dynamic program for an investment optimization problem
Cites Work
- A linear-time algorithm for concave one-dimensional dynamic programming
- Geometric applications of a matrix-searching algorithm
- Speeding up dynamic programming with applications to molecular biology
- Monge strikes again: Optimal placement of web proxies in the internet
- Perspectives of Monge properties in optimization
- Online maintenance of \(k\)-medians and \(k\)-covers on a line
- The concave least-weight subsequence problem revisited
- On-line dynamic programming with applications to the prediction of RNA secondary structure
- Unnamed Item
This page was built for publication: Online dynamic programming speedups
