CMPS211: Combinatorial Algorithms

*****COURSES ARE SUBJECT TO CHANGE*****

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

YearFallWinterSpringSummer
2016-17
2014-15
2013-14
2011-12
2007-08
2006-07
2005-06

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.