Course Websites
CS 583 - Approximation Algorithms
Last offered Fall 2021
Official Description
Approximation algorithms for NP-hard problems. Basic and advanced techniques in approximation algorithm design: combinatorial algorithms; mathematical programming methods including linear and semi-definite programming, local search methods, and others. Algorithms for graphs and networks, constraint satisfaction, packing and scheduling. Course Information: Prerequisite: CS 573 or consent of instructor.
Related Faculty
| Title | Section | CRN | Type | Hours | Times | Days | Location | Instructor |
|---|---|---|---|---|---|---|---|---|
| Approximation Algorithms | AA | 61241 | LEC | 4 | 1230 - 1345 | T R | 0216 Siebel Center for Comp Sci | Chandra Chekuri |