Computer Science 672:
Approximation Algorithms (4.0 units)
Algorithmic techniques include combinatorial algorithms and rounding of linear and semi-definite programs. Applications include network design, graph cuts, covering problems, and approximation hardness.
Section | Session | Type | Time | Days | Registered | Instructor | Location | Syllabus | Info |
---|---|---|---|---|---|---|---|---|---|
30103D | 048 | Lecture | 3:00-6:20pm | Monday | 11 of 40 | Shaddin Dughmi | SOSB37 |