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.
SectionSessionTypeTimeDaysRegisteredInstructorLocationSyllabusInfo
29978D048Lecture2:00-3:50pmMon, Wed13 of 16Shaddin DughmiKAP164feesession dates
Information accurate as of October 14, 2020 2:01 pm.
The Fall 2020 semester will begin with fully remote instruction, with limited exceptions for clinical education. Faculty will contact students to provide information to login to classes. Read more.