601.435/635 Approximation Algorithms - Spring 2024

Instructor: Michael Dinitz
Lecture: T Th 9am - 10:15am, Hodson 213
Office Hours: Thursday 1:30pm - 2:45pm and by appointment, Malone 217
Teaching Assistants: Resources:

Date Topic Reference Notes
 Jan 23   Intro, Vertex Cover   Lecture Notes, Video, Chapter 1.1    
 Jan 25   Steiner Tree, TSP   Lecture Notes, Lecture Board, Video, Chapter 2.4, Exercise 2.5    
 Jan 30   Greedy: Set Cover   Lecture Notes, Video, Chapter 1.6    
 Feb 1   Greedy: Max Coverage, k-Center   Lecture Notes, Lecture Board, Video, Chapter 2.2, Exercise 2.11    
 Feb 6   Local Search: Max Cut and Weighted Max Cut   Lecture Notes, Lecture Board, Video   HW1 released 
 Feb 8   Local Search: Min Degree Spanning Tree   Lecture Notes, Lecture Board, Video, Chapters 2.6, 9.3    
 Feb 13   Rounding and Dynamic Programming: Knapsack   Lecture Notes, Lecture Board, Video, Chapter 3.1    
 Feb 15   Rounding and Dynamic Programming: Min Makespan Scheduling   Lecture Notes, Lecture Board, Video, Chapter 3.2   HW1 due, HW2 released 
 Feb 20   Intro to LPs for Approximation Algorithms   Lecture Notes, Lecture Board, Video, Chapters 1.2, 1.3, 4.3, Appendix A    
 Feb 22   Deterministic Rounding: Metric Uncapacitated Facility Location   Lecture Notes, Lecture Board, Video, Chapter 4.5    
 Feb 27   Randomized Rounding: Set Cover and UFL   Lecture Notes, Lecture Board, Video, Chapters 1.7, 5.8    
 Feb 29   Randomized Rounding: Integer Multicommodity Flow   Lecture Notes, Lecture Board, Video, Chapters 5.10, 5.11   HW2 due, HW3 released 
 Mar 5   Randomized Rounding: Group Steiner Tree   Notes from CMU, GKR paper    
 Mar 7   Tree Embeddings and Group Steiner Tree       
 Mar 12   Tree Embeddings: FRT   Chapter 8.5    
 Mar 14   LPs as Metrics: s-t Mincut and Multiway Cut   Chapters 8.1, 8.2   HW3 due, HW4 released 
 Mar 26   LPs as Metrics: Multiway Cut and Multicut   Chapter 8.2    
 Mar 28   LPs as Metrics: Multicut   Chapter 8.3    
 Apr 2   LP duality and flow/cut gaps   Chapter 1.4, Appendix A   HW4 due, HW5 released 
 Apr 4   Dual Fitting and Primal-Dual Algorithms   Chapters 1.5, 1.6, 7.1, 7.3    
 Apr 9   Primal-Dual: Steiner Forest   Chapter 7.4    
 Apr 11   Strengthening Relaxations: Knapsack-Cover Inequalities   Chapter 7.5    
 Apr 16   Semidefinite Programming: Max-Cut   Chapters 6.1, 6.2   HW5 due 
 Apr 18   Semidefinite Programming: Correlation Clustering and Max-2SAT   Chapter 6.4    
 Apr 23   Hardness of Approximation and the PCP Theorem   Chapters 16.1, 16.2, 16.3    
 Apr 25   Hardness of Approximation: Two-Prover Proof Systems and Label Cover   Chapter 16.4    



Assignments

Please submit homeworks using Gradescope (entry code 5JWJYJ).

Additional Resources

Some texts that are related to topics we will cover. They are useful for further study in this field. Similar courses with nice scribe notes. Courses on related material with nice scribe notes.