15-854 Approximation Algorithms, Fall 2005 (original) (raw)

Course description:

The area of approximation algorithms is aimed at giving provable guarantees on the performance of heuristics for hard problems. The course will present general techniques (such as convex programming-based approaches, randomness and metric methods) that underly these algorithms. See here for more information and admin details...