skip to main content

CS 583 -

Fall 2020

Official Description

Approximation algorithms for NP-hard problems. Basic and advanced techniques in approximation algorithm design: combinatorial algorithms; mathematical programming methods including linear and semi-definite programming, local search methods, and others. Algorithms for graphs and networks, constraint satisfaction, packing and scheduling. Course Information: Prerequisite: CS 573 or consent of instructor.