CIS 677 Topics in Algorithms
Combinatorial Optimization and Geometric Algorithms
Class location:
Towne 315, TuTh 430-600pm.
Course Description:
We will look at algorithms for combinatorial optimization and
geometric problems.
Plan:
We will be spending the time rougly equally between the two topics. I will be giving most of the lectures. The students will be asked to
give a presentation or work on a project.
The group works on the problem throughout the semester and is graded together. The grade is the smallest component of this course - the goal of the
course is to learn these topics and explore possible avenues of research.
The course is intended for PhD students and will be appropriately paced.
Masters students need permission of the instructor (even to audit).
Reference Books
The topics we will cover will be related to these books, but we will mostly cover specific papers.
Papers and Topics
This list will be updated as the course progresses.