Computer Science 672:
Approximation Algorithms (3.0 units)
Algorithmic techniques include combinatorial algorithms & rounding of linear and semi-definite programs. Applications include network design, graph cuts, covering problems, & approximation hardness. Recommended preparation: Basic background in probability and linear algebra.
| Section | Session | Type | Time | Days | Registered | Instructor | Location | Syllabus | Info |
|---|---|---|---|---|---|---|---|---|---|
| 29973D | 048 | Lecture | 2:00-3:20pm | Tue, Thu | 19 of 40 | Shaddin Dughmi | VHE217 |   |