Please enable JavaScript.
Coggle requires JavaScript to display documents.
Dynamic Programming, Approximation Algorithms - Coggle Diagram
Dynamic Programming
-
Principle of optimality
"An optimal solution to any instance of an optimization problem is composed of optimal solutions to its sub-instances"
-
It suggests solving each of the smaller subproblems only once and recording the results in a table from which a solution to the original problem can then be obtained
-
-
-
-
-