Part I: Here the section numbers refer to Williamson/Shmoys: The Design of Approximation Algorithms.

1. (Aug 30) Introduction: Vertex Cover, TSP (Sec 2.4)
2. (Sep 02) Introduction to Linear Programming (Appendix A, Sec 4.3)
3. (Sep 07) LP-Rounding: Set Cover (Sec 1.2-1.3, 1.7)
4. (Sep 09) LP-Rounding: MAX-SAT (Sec 5.1, 5.4-5.6)
5. (Sep 13) LP-Rounding: Minimizing Congestion (Sec 5.10-5.11)
6. (Sep 16) LP-Rounding: Minimizing Congestion and Chernoff Bounds (Sec 5.10-5.11)
7. (Sep 20) LP-Duality and Primal-Dual Algorithms (Appendix A, Sec 7.1)
8. (Sep 23) Primal-Dual: Shortest Path (Sec 7.3)
9. (Sep 27) Cuts and Metrics: Introduction and Multicut (Sec 8.3)
10. (Sep 30) Cuts and Metrics: Multiway Cut (Sec 8.1-8.2)
11. (Oct 04) Intro to Semidefinite Programming (SDP), Max-Cut (Sec 6.1-6.2)
12. (Oct 07) SDP Rounding: Max 2SAT, Midterm Exam due
13. (Oct 14) SDP Rounding: Correlation Clustering (Sec 6.4)
14. (Oct 18) Greedy Algorithms: Set Cover, Submodular functions/Max Coverage (Sec 1.6, 2.5)
15. (Oct 21) Greedy Algorithms: k-Center (Sec 2.2); Local Search: Max-cut
16. (Oct 25) Local Search: k-Median (Sec 9.2)
17. (Oct 28) Hardness of Approximation: Gap-Preserving Reductions (Sec 16.1-16.2)

1. (Nov 01) Introduction to Game Theory (Sec 1.1-1.3)
2. (Nov 04) Game Theory: Network Formation Games, Congestion Games, and Potential Games (Sec 17.1-17.2, 19.3)
3. (Nov 08) Game Theory: Selfish Routing (Ch 18, Roughgarden 11,12.2))
4. (Nov 11) Game Theory: Price of Anarchy in Smooth Games (Roughgarden Lecture 14)
5. (Nov 15) Game Theory: Utility Games (Sec 19.4)
6. (Nov 18) Introduction to Markets and Pricing (Sec 11.1, 11.3)
7. (Nov 22) Pricing: Maximizing Social Welfare and Linear Programming (Sec 11.3, 11.5)
8. (Nov 29) Pricing: Walrasian Equilibrium, Gross-Substitutes (Sec 11.7)
9. (Dec 02) Pricing: Single Minded Valuations (Sec 11.2)
10. (Dec 06) Pricing: Maximizing Revenue
11. (Dec 09) Pricing: Combinatorial Walrasian Equilibrium, Sequential Buyer Arrival