| Date | Lecture Topic | Reading | Homework Due | Assigned |
|---|---|---|---|---|
| Thur, Aug 23 | Introduction via a scheduling problem | |||
| Tue, Aug 28 | Greedy Algorithms | 17.1-17.2 | ||
| Thur, Aug 30 | Greedy Algorithms (cont) | 17.3 | Homework 1 | |
| Tue, Sept 4 | Greedy Algorithms (cont) | 17.5 | ||
| Thur, Sept 6 | Dynamic Programming | 16.1, 15.1 of 2nd ed. | ||
| Tue, Sept 11 | Dynamic Programming (cont) | 16.2 | ||
| Thur, Sept 13 | Dynamic Programming (cont) | 16.3, 15.5 of 2nd ed. | Homework 1 | Homework 2 | Tue, Sept 18 | More Dynamic Programming Examples | Thur, Sept 20 | Linear Programming | 29.1-29.2 of 2nd ed. |
| Tue, Sept 25 | NP-completeness | 36.1-36.3 | ||
| Thur, Sept 27 | NP-completeness | 36.4 | Homework 2 | |
| Tue, Oct 2 | NP-completeness reductions | 36.5 | ||
| Thur, Oct 4 | EXAM 1 | Homework 3 | ||
| Tue, Oct 9 | More NP-completeness reductions | |||
| Thur, Oct 11 | Approximation Algorithms | 37.1-37.2 | ||
| Tue, Oct 16 | Approximation Algorithms (cont) | 37.3 | ||
| Thur, Oct 18 | Approximation Algorithms (cont) | 35.4 in 2nd ed. | Homework 3 | Homework 4 |
| Tue, Oct 23 | Approximation Algorithms (cont) | 37.4 | ||
| Thur, Oct 25 | Finding exact complexity of a problem | 10.1 | ||
| Tue, Oct 30 | Lower Bound Techniques | Handout | ||
| Thur, Nov 1 | Lower Bound Techniques (cont) | Homework 4 | ||
| Tue, Nov 6 | Lower Bound Techniques (cont) | |||
| Thur, Nov 8 | EXAM 2 | Homework 5 | ||
| Tue, Nov 13 | On-line Algorithms and Competitive Analysis | Handout | ||
| Thur, Nov 15 | On-line Algorithms and Competitive Analysis (cont) | |||
| Tue, Nov 20 | On-line Algorithms and Competitive Analysis (cont) | |||
| Thur, Nov 22 | No Class -- Thanksgiving Break | |||
| Tue, Nov 27 | String Matching | 34.1-34.2 | ||
| Thur, Nov 29 | String Matching | 34.3-34.4 | Homework 5 | |
| Tue, Dec 4 | Review | |||
| Tue, Dec 11 | Final Exam 1:00pm-3:00pm (location TBA) |