| Slides from each lecture will be posted on this page as the course progresses. The lecture recordings will be posted to the course Quercus page. |
|
| Week |
Topic |
Slides |
Reading
|
| 1 |
Course introduction; Divide & Conquer |
Slides |
CLRS Ch 4, DPV Ch 2, KT Ch 5 |
| 2 |
Greedy Algorithms (Part 1) |
Slides |
CLRS Ch 16, DPV Ch 5, KT 4 |
| 3 |
Greedy Algorithms (Part 2) |
Slides |
Same as above |
| 4 |
Dynamic Programming Starts |
Slides |
CLRS Ch 15, DPV Ch 6, KT Ch 6 |
| 5 |
Dynamic Programming Ends; Network Flow Starts |
Slides |
CLRS Ch 26, DPV Ch 7(7.1-7.3), KT Ch 7 |
| 6 |
Network Flow Applications |
Slides |
Same as above |
| 7 |
Linear Programming (Part 1) |
Slides |
CLRS Ch 29, DPV Ch 7 |
| 8 |
Linear Programming (Part 2) |
Slides |
Same as above |
| 9 |
Complexity (Part 1) |
Slides |
CLRS Ch 34, DPV Ch 8, KT Ch 8 |
| 10 |
Complexity (Part 2) |
Slides |
Same as above |
11 |
Complexity Ends; Review |
Slides, Review Slides |
Same as above |
