Aug 20, 2019  
2018-2019 Catalog 
2018-2019 Catalog [ARCHIVED CATALOG]

[Add to My Catalog]

EECS 279: Approximation Algorithms

Units: 4

Optimization problems are prevalent in many disciplines, and computer science is no exception. Unfortunately, numerous optimization problems are computationally hard (e.g. NP-hard), hence resist efficient algorithms. Covers various approximation algorithms which are polynomial time heuristics that aim to give a solution close to the optimum for all inputs.

Course Details
Repeatable for Credit: No
Normal Letter Grade only

Requisites and Restrictions
Instructor Permission Required: No
Knowledge of Algorithm Design and Analysis, or an equivalent course, strongly recommended

Fall 2019 course scheduling information

[Add to My Catalog]