CS 369P: Polyhedral techniques in combinatorial optimization

Stanford University, Fall 2010

Lectures: Tue/Thu 9:30 - 10:45 am, Gates 100
Instructor: Jan Vondrak (IBM Almaden Research)
E-mail: jvondrak@gmail.com
Office hours: by appointment

Lecture notes:

Part I
Part II Sample file for scribes

Course description:
This is a graduate-level course in combinatorial optimization with a focus on polyhedral characterizations. In the first part of the course, we will cover some classical results in combinatorial optimization: algorithms and polyhedral characterizations for matchings, spanning trees, matroids, and submodular functions. In the second part, we will cover some more recent work that builds upon these techniques - approximation algorithms using the primal-dual scheme, iterated rounding and dependent randomized rounding. Applications will include allocation in combinatorial auctions, network design, and variants of the traveling salesman problem.

Prerequisites: Students should know basic computation theory and the material of CS 261; in particular the fundamentals of linear programming, approximation algorithms and the notion of NP-completeness.

Grading: There will be bi-weekly homeworks which constitute 50%. A take-home final exam will count for the remaining 50%.
In addition, students will be asked to scribe notes in LaTeX. Writing up one lecture allows you to skip one homework.

Additional material: