| |
Apr 16, 2024
|
|
|
|
|
EECS 279: Approximation Algorithms
[4.0 units]
Optimization problems are prevalent in many disciplines, and computer science is no exception. Unfortunately, numerous optimization problems are computationally hard (eg. NP-hard), hence resist efficient algorithms. This course covers various approximation algorithms which are polynomial time heuristics that aim to give a solution close to the optimum for all inputs. Knowledge of Algorithm Design and Analysis, or an equivalent course, is strongly suggested.
Normal Letter Grade only.
View course scheduling information
Add to My Catalog (opens a new window)
|
|
