CSC 205 - Combinatorial Optimization

Semester Hours: 3

Periodically
Brief overview of algorithm design and analysis; linear algebra; linear programming; the simplex algorithm; dynamic programming; greedy algorithms; amortized analysis; algorithms for matching; network flow; packing and scheduling; and branch and bound algorithms.

Prerequisite(s)/Course Notes:
CSC 204. (Formerly Algorithms II: Combinatorial Algorithms.)