Handouts
Class handouts and assignments are posted here. Solutions are not provided. If you are a student from the class or an instructor teaching algorithms or computational geometry at another institution, you may request a copy of the solutions. I do not provide solutions directly to students.
| Assignment |
Due Date |
| Homework 1 DFS, Paths, and Greedy |
Thu, Feb 20 |
| Homework 2 Greedy Algorithms and Dynamic Programming |
Tue, Mar 11 |
| Homework 3 Dynamic Programming and More |
Tue, Apr 1 |
| Homework 4 Flows and NP-Completeness |
Tue, Apr 29 |
| Homework 5 NP-Completeness and Approximation |
Tue, May 13 |
Web Accessibility
