CS 261: A Second Course in Algorithms



Course Assistants:

Time/location: 1:30-2:50 PM Tue/Thu in 380-380C.

Piazza site: here

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.

Lecture videos and notes