CS 583

spring 2026
 
All Classes

Credit: 4 hours.

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.

Prerequisite: CS 573, CSE 515 or consent of instructor.

Closed
Section Status Closed
Open
Section Status Open
Pending
Section Status Pending
Open (Restricted)
Section Status Open (Restricted)
Unknown
Section Status Unknown
Detail Status CRN Type Section Time Day Location Instructor