CME 305: Discrete Mathematics and Algorithms
Instructor: Reza Zadeh
Time: Tue, Thu 10:30 AM - 11:50 AM
Room: Bishop Auditorium
- Basic Algebraic Graph Theory
- Minimum Spanning Trees and Matroids
- Maximum Flow and Submodularity
- Approximation Algorithms
- Randomized Algorithms
- The Probabilistic Method
- Spectral Sparsification
This course is targeting doctorate students with strong foundations in mathematics who wish to become more familiar with the design and analysis of discrete algorithms. An undergraduate course in algorithms is not a prerequisite, only familiarity with basic notions in linear algebra and discrete mathematics.
Grade breakdown: 50% final, 30% midterm, 20% assignments (4 of them). The midterm and final will be good practice for the ICME qualifying exam.
Algorithm Design by Kleinberg and Tardos [KT]
Graph Theory by Reinhard Diestel [D]
Approximation Algorithms by Vijay Vazirani [V]
Randomized Algorithms by Rajeev Motwani and Prabakhar Raghavan [MR]
The Probabilistic Method by Noga Alon and Joel Spencer [AS]
Midterm: Thursday, Feb 16th
- Assignment 1 [pdf] [tex], Due at the beginning of class Thursday 01/26
- Assignment 2 Due at the beginning of class Thursday 02/09
- Assignment 3 Due at the beginning of class Thursday 03/02
- Assignment 4 Due at the beginning of class Thursday 03/14
Note that these references are not intended to be any substitute for the material covered during lectures.
Spring 2012 Qual pdf.
Fall 2012 Qual pdf.
Spring 2013 Qual pdf.
2016 Midterm pdf, Solutions pdf
2015 Midterm pdf, Solutions pdf
2014 Midterm and Solutions pdf,
2011 Midterm pdf,
2010 Midterm pdf,
Practice Midterm 1 (In-Class) pdf,
Practice Midterm 2 (In-Class) pdf,
Problem Session 3/11/16
Problem Session 2/11/15 and Solutions
Problem Session 2/10/15 and Solutions
Problem Session 2/10/14 and Solutions
Problem Session 2/20/14 and Solutions
Winter 2016: Class website
Winter 2015: Class website
Winter 2014: Class website
Reza Zadeh (rezab at stanford)
Office hours: by appointment
Andreas Santucci (santucci at stanford)
Office hours: Tuesday, 12 - 2.
Nolan Skochdopole (naskoch at stanford)
Office hours: Wednesday, 1 - 3.
TA office hours will be held in the Huang Engineering Center basement (in front of the ICME office)