Detailed Course Information |
2025 Winter
Apr 22, 2025 |
|
 |
||
 | Select the desired Level or Schedule Type to find available classes for the course. |
| CS 890EY - Approximation Algorithms |
|
We study design and analysis techniques for approximation algorithms, i.e., efficient algorithms that provide solutions to combinatorial optimization problems with mathematically provable guarantees on the ratio of their objective values to that of the optimal solution. Examples of techniques include linear programming, dynamic programming, local search, and greedy algorithms.
3.000 Credit hours 3.000 Lecture hours Levels: Graduate Schedule Types: Lecture, Independent Study, Directed Reading, Examination Computer Science Department Restrictions: Must be enrolled in one of the following Levels: Graduate |
| Return to Previous | New Search |
|