Please enable JavaScript.
Coggle requires JavaScript to display documents.
Dynamic Programming, Approximation Algorithms for NP -Hard Problems -…
Dynamic Programming
-
Applicability
Requires the problem to satisfy the principle of optimality, an optimal solution to any of its instances must be made up of optimal solutions to its subinstances.
-
Dynamic programming can be used for constructing an optimal binary search
tree for a given set of keys and known probabilities of searching for them.
-
The memory function technique seeks to combine the strengths of the top-down and bottom-up approaches to solving problems with overlapping subproblems.
-