Please enable JavaScript.
Coggle requires JavaScript to display documents.
Dynamic Programming, Approximation Algorithms for NP-Hard Problems -…
Dynamic Programming
Three Basic Examples
Since a majority of dynamic programming applications deal with optimization problems, we also need to mention a general principle that underlines such applications. Richard Bellman called it the principle of optimality.
-
-