CMPS 211: Combinatorial Algorithms
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. D. Achlioptas, P. Kolaitis
5 Credits
While the information on this web site is usually the most up to date, in the event of a discrepancy, please contact your adviser to confirm which information is correct.