Schedule

This is a preliminary schedule, to show the structure of the course. Small changes may happen.

1. Monday, Nov 7, 10:15 Basics, greedy algorithms, KT Ch 2,4 2. Wednesday, Nov 9, 10:15 Divide and conquer, Dynamic programming, KT Ch 5,6 3. Monday, Nov 14, 10:15 Garphs and flows, KT Ch 3,7 4. Wednesday, Nov 16, 10:15 Complexity, KT Ch 8,10 5. Monday, Nov 21, 10:15 DKH Ch 1-2 6. Wednesday, Nov 23, 10:15 DKH Ch 3 7. Monday, Nov 28, 10:15 DKH Ch 6 + student presentations 8. Thursday, Dec 1, 10:15 DKH Ch 7 + student presentations 9. Wednesday, Dec 7, 10:15 DKH Ch 7 + student presentations 10. Wednesday, Dec 14, 10:15 DKH Ch 8 + student presenations KT: Jon Kleinberg, Éva Tardos, “Algorithm Design” DKH: Ding-Zhu Du, Ker-I Ko, Xiaodong Hu, “Design and Analysis of Approximation Algorithms”