This is an old revision of the document!
Chapter 6
6.1: Weighted Interval Scheduling: A Recursive Procedure
- More general version of the greedy algorithms we worked on before.
- Dynamic programming solution: a recurrence equation that expresses the optimal solution (or its value) in terms of the optimal solutions to smaller sub-problems
- Memoization:
- Saving values that have already been computed to reduce run time.
