Online dynamic programming speedups (Q839641)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Online dynamic programming speedups	scientific article

Statements

scholarly article

0 references

Online dynamic programming speedups (English)

0 references

0 references

Mordecai J. Golin

0 references

0 references

Theory of Computing Systems

0 references

publication date

2 September 2009

0 references

zbMATH Keywords

dynamic programming

0 references

Monge property

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s00224-009-9166-x

0 references

Geometric applications of a matrix-searching algorithm

0 references

0 references

Perspectives of Monge properties in optimization

0 references

Online maintenance of \(k\)-medians and \(k\)-covers on a line

0 references

Speeding up dynamic programming with applications to molecular biology

0 references

A linear-time algorithm for concave one-dimensional dynamic programming

0 references

On-line dynamic programming with applications to the prediction of RNA secondary structure

0 references

The concave least-weight subsequence problem revisited

0 references

Monge strikes again: Optimal placement of web proxies in the internet

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/s00224-009-9166-x

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:839641

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q839641&oldid=35126054"