| |
Jan 15, 2025
|
|
|
|
|
CSCI 4040 - 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.
Prerequisites/Corequisites: Prerequisite: CSCI 4020 or permission of instructor.
When Offered: Fall term odd-numbered years.
Co-Listed: CSCI 6040 . Students cannot receive credit for both CSCI 4040 and CSCI 6040 .
Credit Hours: 4
Add to Portfolio (opens a new window)
|
|
