Academics / Courses / DescriptionsCOMP_SCI 497: Topics in Combinatorial Optimization
VIEW ALL COURSE TIMES AND SESSIONS
Prerequisites
CE/CS/IEMS PhDs or CS 336 or Permission of InstructorDescription
In this graduate-level course, we will be covering advanced topics in combinatorial optimization. We will start with matchings and cover many results, extending the fundamental results of matchings, min cost flows and matroids. The emphasis is on the derivation of combinatorial results, including min-max relations, as well as on the corresponding algorithmic questions of how to find such objects. The intended audience consists of Ph.D. students interested in optimization, combinatorics, or combinatorial algorithms. CS 336 is a pre-requiste for this course, and I would recommend this class for students who did exceptionally well in either CS 336 or similar undergraduate courses on Algorithms. The course will be proof based, and will also involve guest lectures by postdocs and PhD students.
- This course fulfills the Project or Technical Elective area.
REFERENCE TEXTBOOKS: N/A
REQUIRED TEXTBOOK: N/A
COURSE COORDINATORS: Samir Khuller
COURSE INSTRUCTOR: Prof. Khuller
COURSE GOALS: