Check back here weekly as we go along, ...
Last updated on Thursday Jan 16, 2003
- Topics: Review of NP-Completeness and Proof Techniques
- Reading Assignments:
- lecture notes and a tutorial.
- see also the helpful links section for related materials.
- Topics: Linear Programming, including
- geometry, Farkas' lemma, strong duality
- complexity
- interior-point algorithms
- ellipsoid algorithm and optimization vs. separation
- extension to conic programming
- geometry, Farkas' lemma, strong duality
- Reading Assignments:
- Chapters 1-9, 16, 17, 18, Chvatal's book.
- A tutorial on linear algebra. You do not have to read the section on eigenvalues.
- Topics and Readings: Same as last week
- Jan 28 - Homework 1 out
- Topics and Readings: Same as last week
- Topics: Network Flows, including
- maximum flows, min-cost flows
- cycle cancelling algorithms
- strongly polynomial-time analysis
- minimum cuts without flows
- maximum flows, min-cost flows
- Reading Assignments:
- Chapters 19-23 Chvatals' book.
- Feb 13 - Homework 1 due, Homework 2 out
- Topics and Readings: Same as last week
- Topics and Readings: Same as last week
- Finishing touch on linear programming and network flows, and Review for midterm exam.
- Mar 04 - Homework 2 due.
- Midterm exam: Mar 06
- No class for this week: Spring Break
- Topics: Approximation Algorithms.
- limits to approximability
- basic techniques and vertex cover
- primal-dual technique
- semidefinite programming
- multicommodity cut via embedding metric spaces
- approximation scheme for Euclidean TSP.
- limits to approximability
- Reading Assignments:
- Mar 18 - Homework 3 out
- Topics and Readings: Same as last week.
- Topics and Readings: Same as last week.
- Apr 03 - Homework 3 due, Homework 4 out
- Topics and Readings: Same as last week.
- Topics and Readings: Same as last week.
- Topics and Readings: Same as last week.
- Apr 24 - Homework 4 due
- No fixed date yet!