Next: Dynamic Programming Implimentation
Up: DYNAMIC PROGRAMMING REQUIREMENTS
Previous: Observation 2: Overlapping Subproblems
(to deal with overlapping problems)
- after computing solution to a subproblem, sort
in a table. Subsequent call-do table lookup.
- Time O(mn)
- each problem is solved once and used twice.
- see in figure for 1,2 or 2,3
- might not need to solve all subproblem, only those
needed.
Sushil Prasad
Thu May 13 13:06:05 EDT 1999