Instructor: Amir Nayyeri (Office hours: Tue 3:30pm-4:30pm at KEC 3061)
Lectures: Tue, Thr 2:00pm-3:20pm in WNGR 116
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.
Evaluation: Homework (60%), Midterm (40%)
Prerequisites: (CS 325 or CS 325H) and MTH 232