CS 261: Optimization and Algorithmic Paradigms (Winter 2020)
Instructors: Moses Charikar and Ofir Geri
Location and time: Tuesday and Thursday 10:30am – 11:50am, School of Education 128
Teaching assistants: Weiyun (Anna) Ma and Ofir Geri
Please sign up on Piazza for discussions. We monitor Piazza at least daily.
Contact Information: Please use a private post on Piazza to contact the course staff (all or one of us).
Office Hours:
- Moses: Friday 10:00am - 11:00am, Gates 472
- Ofir: Friday 3:00pm - 5:00pm, Gates 459
- Anna: Monday 2:00pm - 4:00pm, Gates 459 then moving to 415 (when available)
Requirements: four problem sets (2/3 of the final grade), in-class final exam (1/3 of the final grade)
List of Topics
- Maximum flow and matching in graphs
- Linear programming and applications
- Online algorithms, multiplicative weights
- Approximation algorithms
- Other topics: distributed algorithms, beyond worst case analysis, fine-grained complexity