CS 231: Topics in Combinatorial Algorithms

Subhash Suri
TR 09:00-10:50
Room: Phelps 2510


Administrative Stuff

Course Description

Algorithmic thinking is at the heart of computer science. Whether we wish to understand the structure of a social network, design algorithms that learn from data, build autonomous robots, measure reliability of complex systems, or design strategyproof auctions, the underlying core problem is often an algorithmic one. This course will focus on two of the most celebrated and fundamental techniques in algorithm design, Network Flows and Linear Programming, covering both their underlying theory and their use in solving combinatorial problems. See the tentative schedule.

Students are expected to have a mastery of undergraduate-level algorithms and complexity, and should be conversant in discrete math concepts such as graph theory, probability, and combinatorics. The course is organized around the following topics:

The course grade will be determined by 3 homework assignments (45%), 1 midterm exam (20%), and 1 final project (35%).

Homework Assignments

Final Project