Skip Navigation
Jack Baskin School of EngineeringUC Santa Cruz

CMPS 211


Fundamental combinatorial algorithms, graph algorithms, flow problems,
matching problems, linear programming, integer programming,
NP-completeness, approximation algorithms for optimization problems.
Prerequisite(s): course 201. Offered in alternate academic years.  P.
Kolaitis, D. Achlioptas

(sourced from /cse/classes/cmps211/description.txt)