| |
Jul 31, 2025
|
|
|
|
|
CSCI 6040 - Approximation Algorithms
Algorithms with provable guarantees on the quality of their solutions are a powerful way of dealing with intractable problems. This course covers fundamental techniques for designing approximation algorithms. Possible topics include: semi-definite and linear programming, inapproximability and the PCP theorem, randomized rounding, metrics and cuts, primal-dual methods, and online algorithms.
Prerequisite: Prior knowledge of CSCI 4020
When Offered: FALL TERM, ODD YEARS
Co-Listed: CSCI 4040 . Students cannot receive credit for both CSCI 4040 and CSCI 6040.
Graded: GRADED
Credit Hours: 4
Add to Portfolio (opens a new window)
|
|
