CSE202: Combinatorial Algorithms

Fundamental combinatorial algorithms, graph algorithms, flow problems, matching problems, linear programming, integer programming, NP-completeness, approximation algorithms for optimization problems.

5 Credits

This class has not been taught recently.

Comments

Formerly CMPS 211

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.