CS 145: Combinatorial Optimization Algorithms

2008-09 2009-10 →
changes (lax) changes (strict) ▾ 2012-13 → 2012-13 →

Units: 4

Hours: Lecture, 3 hours; discussion, 1 hour

Catalog page 192

Prerequisites: CS 141; MATH 113 or MATH 131

Description: The study of effi- cient algorithm design techniques for combinatorial optimization problems. Topics include shortest paths, minimum spanning trees, network flows, maximum matchings, stable matchings, linear programming, duality, two-person games, algorithmic techniques for integer programming problems, NP-completeness, and approximation algorithms.

Derived Information — The following is not part of the official catalog but is computed from catalog data.
Prerequisite graph not available.

Referenced in

Enrollment History (from UCR Banner, not catalog)
Year F W S Su Total
2025-26 34/60 34/60
2024-25 19/40 19/40
2023-24 24/80 24/80
2022-23 38/80 38/80
2021-22 20/50 20/50
2020-21 29/60 29/60
2019-20 11/40 11/40
2018-19 33/50 33/50
2016-17 35/40 35/40