CS 261: Optimization and Algorithmic Paradigms



Course Assistants:

Time/location: 9:30-10:45 AM Tue/Thu in 380-380C.

Piazza site: here.

Email address for PSet submissions: cs261submissions@gmail.com

Staff mailing list: cs261-spr1415-staff@lists.stanford.edu

Prerequisites: CS161 or equivalent.

Course Description

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 online algorithms.



Tentative Lecture Schedule (under construction)