Computer Science and EngineeringCSE 202 Combinatorial Algorithms

Fundamental combinatorial algorithms, graph algorithms, flow problems, matching problems, linear programming, integer programming, NP-completeness, approximation algorithms for optimization problems. (Formerly Computer Science 211.)

Requirements

Prerequisite(s): CSE 201.

Credits

5

Quarter offered

Winter

Instructor

Allen Van Gelder, Phokion Kolaitis, Demetrios Achlioptas