Tuesday, July 17, 2007

Dynamic programming - Pattern to find optimal substructure

1. Solution to the problem consists of making a choice.
2. Suppose for a given problem, a choice is given to lead to an optimal solution.
3. Given this choice, determine which subproblems ensue and how to best characterize the resulting space of subproblems.
4. Show solution to subproblem must be optimal by using "cut-and-paste" technique.

No comments: