Approximation Algorithms
3.0
creditsAverage Course Rating
This course provides an introduction to approximation algorithms. Topics include vertex cover, TSP, Steiner trees, cuts, greedy approach, linear and semi-definite programming, primal-dual method, and randomization. Additional topics will be covered as time permits. There will be a final project. Students may receive credit for EN.600.469 or EN.600.669, but not both. [Analysis]