The principle of optimality in the design of efficient algorithms (Q1085609)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3982513
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The principle of optimality in the design of efficient algorithms |
scientific article; zbMATH DE number 3982513 |
Statements
The principle of optimality in the design of efficient algorithms (English)
0 references
1986
0 references
In this methodological paper, the author gives a description of applications of the dynamic programming method such as string matching, construction of optimal binary and derivation trees, knapsack problem and NP-complete problems having fully polynomial approximation schemes. The author gives a general formalism and a framework in which dynamic programming is applicable.
0 references
string matching
0 references
trees
0 references
knapsack problem
0 references
NP-complete problems
0 references
0.8502288
0 references
