EdusalsaDiscover Your Stanford

CS 261

Optimization and Algorithmic Paradigms

  • Not Offered

3 units

Letter or Credit/No Credit

Algorithms for network optimization: max-flow, min-cost flow, matching, assignment, and min-cut problems. Introduction to linear programming. Use of LP duality for design and analysis of algorithms. Approximation algorithms for NP-complete problems such as Steiner Trees, Traveling Salesman, and scheduling problems. Randomized algorithms. Introduction to sub-linear algorithms and decision making under uncertainty. Prerequisite: 161 or equivalent.

Course Prequisites

CS 261 is useful for

Grade Distribution

Sign Up

To save CS 261 to your course bucketlist

Already Have An Account? Log In