CSE 711: Topics in Combinatorial Optimization and Linear Programming (Fall 2018 Seminar)

Course Information

Time: Th 2:00PM~4:30PM

Location: Clemen 206

Credits: 1 or 3

Sign up for the course on Piazza here.

Instructor

Shi Li

Office: 328 Davis Hall

Email: [first name][last name initial][at][buffalo][dot][edu]

Homepage: http://www.cse.buffalo.edu/~shil/

Office hours for the course: Wed 2:00pm-3:00pm

Overview

Linear programming is a powerful tool in solving combinatorial optimization problems. This graduate-level seminar course focuses on its power and limitations in designing exact and approximation algorithms for solving these problems in a rigorous manner. It will cover the following topics in this order:

Prerequisites

Students who take this course should have already taken the design and analysis of algorithms course (CSE 331, CSE 431/531 or some equivalent courses), and have interest in the theoretical aspect of algorithm design. A reasonable background in mathematics is expected; if you are not sure, talk to the instructor.

Grading

A student can take the course for either 1 or 3 credits. A student with the 1-credit option is graded based on participation and scribing lecture notes while a student with the 3-credit option will also be required to either give a 1-hour presentation during the class or complete the homework of the class.

There will be 13 lectures for the course (no classes for the weeks of Sep 17 and Nov 19), and each lecture will be split into 2 one-hour slots, one from 2:00pm-3:00pm and one from 3:10pm-4:10pm.

Students taking the course for 3 credits need to get 70% of the score in order to pass the course, and those who take it for 1 credit need to get 40% of the total score (counting only participation and scribing) to pass the course.

Reference Materials

Tentative Schedule