CS 420/520: Graph theory with applications to computer science

Instructor: Amir Nayyeri (Office hours: Thr 3:30pm-4:30pm at KEC 3061)

TA: Pingan Zhu (Office hours: Mon 2:00pm-3:00pm at Kelley Atrium)

Lectures: Tue, Thr 2:00pm-3:20pm in COVL 221

Course description: The course covers efficeient (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:

Course requirement: There will be four problem sets.

Prerequisites: (CS 325 or CS 325H) and MTH 232