MS&E 319: Approximation Algorithms
Combinatorial and mathematical programming techniques to derive approximation algorithms for NP-hard optimization problems. Prossible topics include: greedy algorithms for vertex/set cover; rounding LP relaxations of integer programs; primal-dual algorithms; semidefinite relaxations. May be repeated for credit. Prerequisites: 112 or
CS 161.
Terms: Aut
| Units: 3
| Repeatable
for credit
Instructors:
Saberi, A. (PI)
Filter Results: