Instructor: Amir Nayyeri (Office hours: Thr 3:30pm-4:30pm at KEC 3061)
TA: Hung Le (Office hours: Fri 3:30pm-4:30pm at Kelley Atrium)
Lectures: Tue, Thr 2:00pm-3:20pm in Owen Hall 103
Course description: The course covers efficient (exact or approximation) algorithms for fundamental graph optimization problems such as minimum spanning trees, shortest paths, maximum matching, planar separators, Steiner trees and traveling salesmans problem.
Tentative topic list:
Evaluation: There will be two problem sets and a project. At week 3, each student proposes a project. The project can be a survey paper, or an original research paper about algorithmic graph theory or its applicaitons. At week 4 students form groups of three people. Each group chooses a project from the pool of the proposals to work on. At week 10 each group submits a report and gives a short talk about their project.
Prerequisites: (CS 325 or CS 325H) and MTH 232