| Date | Lecture Topic | Readings | Homework Due | Homework Assigned |
|---|---|---|---|---|
| Thur, Aug 28 | Introduction via a scheduling problem | Homework 0 | ||
| Tue, Sept 2 | Greedy Algorithms | 16.1-16.2 | Homework 1 | |
| Thur, Sept 4 | Greedy Algorithms (cont) | 16.3 | ||
| Tue, Sept 9 | Greedy Algorithms (cont) | 16.5 | ||
| Thur, Sept 11 | Dynamic Programming | 15.1-15.2 | ||
| Tue, Sept 16 | Dynamic Programming (cont) | 15.3 | Homework 1 | Homework 2 |
| Thur, Sept 18 | Dynamic Programming (cont) | 15.4-15.5 | Tue, Sept 23 | More Dynamic Programming (cont) | Thur, Sept 25 | Linear Programming | 29.1-29.2 |
| Tue, Sept 30 | NP-completeness | 34.1-34.3 | Homework 2 | |
| Thur, Oct 2 | NP-completeness (cont) | 34.4 | ||
| Tue, Oct 7 | EXAM 1 | Homework 3 | ||
| Thur, Oct 9 | NP-completeness (cont) | 34.5 | ||
| Tue, Oct 14 | NP-completeness (cont) | |||
| Thur, Oct 16 | Approximation Algorithms | 35.1-35.2 | ||
| Tue, Oct 21 | Approximation Algorithms (cont) | 35.3 | Homework 3 | Homework 4 |
| Thur, Oct 23 | Approximation Algorithms (cont) | 35.4 | ||
| Tue, Oct 28 | Approximation Algorithms (cont) | 35.5 | ||
| Thur, Oct 30 | Finding exact complexity of a problem | 9.1 | ||
| Tue, Nov 4 | Lower Bound Techniques | Handout | Homework 4 | |
| Thur, Nov 6 | Lower Bound Techniques (cont) | |||
| Tue, Nov 11 | EXAM 2 | Homework 5 | ||
| Thur, Nov 13 | Lower Bound Techniques (cont) | |||
| Tue, Nov 18 | On-line Algorithms and Competitive Analysis | Handout | ||
| Thur, Nov 20 | On-line Algorithms and Competitive Analysis (cont) | |||
| Tue, Nov 25 | On-line Algorithms and Competitive Analysis (cont) | Homework 5 | Homework 6 | |
| Thur, Nov 26 | No Class -- Thanksgiving Break | |||
| Tue, Dec 2 | Student Selected Topic | |||
| Thur, Dec 4 | Student Selected Topic | |||
| Tue, Dec 9 | Review | Homework 6 | ||
| Thur, Dec 18 | Final Exam 10:30am-12:30pm (location TBA) |
Readings are from Cormen, Leiserson, Rivest and Stein (2nd Edition).