Covers ideas surrounding approximation algorithms including a rigorous mathematical analysis of the approximation guarantees provided by these algorithms. Teaches the use of linear/integer programming formulations for common algorithmic problems and the relation between integer optimization problems and their linear programming relaxations. Introduces key mathematical concepts needed to analyze these algorithms and explores the application of algorithmic concepts to real-world problems.
instructor(s)
Sankaranarayanan, Sriram
Primary Instructor
- Fall 2023 / Spring 2024 / Summer 2024 / Fall 2024 / Spring 2025 / Summer 2025 / Fall 2025
