Approximation limitations of pure dynamic programming (Q5216795)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Approximation limitations of pure dynamic programming |
scientific article; zbMATH DE number 7170192
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation limitations of pure dynamic programming |
scientific article; zbMATH DE number 7170192 |
Statements
Approximation Limitations of Pure Dynamic Programming (English)
0 references
20 February 2020
0 references
dynamic programming
0 references
greedy algorithm
0 references
approximation
0 references
lower bounds
0 references
0 references
0.8329735994338989
0 references
0.8090776205062866
0 references
0.8089848756790161
0 references
0.7494916915893555
0 references
0.7471467852592468
0 references
