CSE269: Approximation Algorithms

This is a graduate course on Approximation Algorithms, meant for graduate students with a good mathematical background. Students should be familiar with discrete math, algorithms, calculus/probability, graph theory. Topics include clustering, linear programming, LP duality, semidefinite programming etc. Prerequisite(s): Enrollment is restricted to graduate students or by permission of the instructor. Students taking this course need to have had at least one prior course in algorithms, similar to CSE 102 or equivalent. Students will need a solid background in analysis of algorithms, discrete math, probability theory, graph theory, and overall mathematical maturity.

5 credits

Year	Fall	Winter	Spring	Summer
2024-25		Section 01 Evangelos Chatziafratis (evchatzi)

While the information on this web site is usually the most up to date, in the event of a discrepancy please contact your adviser to confirm which information is correct.