EECS 495: Approximation Algorithms

Quarter Offered

Spring : MW 11-12:20 ; Makarychev


EECS 212 and EECS 336 (or similar courses)


This course studies approximation algorithms – algorithms that are used for solving hard optimization problems. Such algorithms find approximate (slightly suboptimal) solutions to optimization problems in polynomial time. Unlike heuristics, approximation algorithms have provable performance guarantees: they have bounds on the running time and on the quality of the obtained solutions. In this course, we will introduce various algorithmic techniques used for solving optimization problems such as greedy algorithms, local search, dynamic programming, linear programming (LP), semidefinite programming (SDP), LP duality, randomized rounding, and primal-dual analysis.

The course assumes background in basic probability theory and discrete mathematics. Key mathematical concepts will be reviewed before they are used.

GRADING: There will be 4 homeworks and no exams.


INSTRUCTOR: Prof. Konstantin Makarychev