Please enable JavaScript.
Coggle requires JavaScript to display documents.
Dynamic Programming, Approximation algorithms for NP-Hard Problems -…
Dynamic Programming
The classic dynamic programming approach works bottom up: fills a table with solutions to all smaller subproblems, but each of them is solved only once.
An unsatisfying aspect of this approach is that solutions to some of these smaller subproblems are often not necessary for getting a solution to the problem given
-
-
-
-
-
-
-