 |
CIS 6930: Approximation Algorithms |
 |
|
| Announcements | Syllabus | Schedule | Lecture Notes | Assignments | |
| Dates | Lecture Notes | |
| Week 1 | 08-23 | Introduction to NP-completeness |
| 08-25 | Vertex Cover | |
| Week 2 | 08-28 | Set Cover |
| 08-30 | Shortest Superstring (SS) via Set Cover | |
| 09-01 | SS via Prefix Graph | |
| Week 3 | 09-06 | Steiner Tree |
| 09-08 | Multiway Cut | |
| Week 4 | 09-11 | k-Cut |
| 09-13 | Connected Dominating Sets | |
| 09-15 | ||
| Week 5 | 09-18 | k-center |
| 09-20 | Bin Packing | |
| 09-22 | Possible Project Topics | |
| Week 6 | 09-25 | |
| 09-27 | ||
| 09-29 | ||
| Week 7 | 10-02 | |
| 10-04 | ||
| Week 8 | 10-09 | Rounding Techniques |
| 10-11 | ||
| 10-13 | ||
| Week 9 | 10-16 | |
| 10-18 | ||
| 10-20 | ||
| Week 10 | 10-23 | |
| 10-25 | ||
| 10-27 | ||
| Week 11 | 10-30 | Primal-Dual Method |
| 11-01 | ||
| 11-03 | ||
| Week 12 | 11-06 | |
| 11-08 | ||
| No class | ||
| Week 13 | 11-15 | |
| 11-17 | ||
| Week 14 | 11-20 | Dual-Fitting Analysis |
| 11-22 | ||
| No class | ||
| Week 15 | 11-27 | Semidefinite Programming |
| 11-29 | ||
| 12-01 | ||
|
|