CSE 269Approximation Algorithms
Meant for graduate students with a good mathematical background. Students should be familiar with discrete math, algorithms, calculus/probability, graph theory. Topics include clustering, linear programming, LP duality, semidefinite programming, etc.
Enrollment is restricted to graduate students or by permission of the instructor. Students taking this course need to have had at least one prior course in algorithms, similar to CSE 102 or equivalent. Students need a solid background in analysis of algorithms, discrete math, probability theory, graph theory, and overall mathematical maturity.
Find a section and add it to your scheduleLive seat counts, time-conflict checks and the walk from your previous class.
When it runs
Fall 2025Open Fall 2025
| Section | Type | When | Where | Instructor | Seats |
|---|---|---|---|---|---|
| 01 | Lecture | Mon Wed 7:10pm–8:45pm | Engineer 2 192 | E. Chatziafratis | Open 10/40 |
Who teaches it
| Instructor | Rating | Difficulty | Would take again | Reviews |
|---|---|---|---|---|
| Vaggos Chatziafratis | 2.8 / 5 | 4.3 / 5 | 37% | 37 |
From RateMyProfessors, which is student-submitted and not a survey. Small review counts move a long way on one bad quarter.
SlugAtlas is a student project and is not affiliated with, endorsed by, or operated by UC Santa Cruz. Course data is a snapshot of the public class search; myUCSC is authoritative for enrolment.