CSE 594: Combinatorial and Graph Algorithms
Spring 2003
Time: Tue,Thr 8:00am-9:20am, Place: Clemen 04.
Instructor: Prof. Hung Q. Ngo Office: 239 Bell Hall
Office Hours: Thursdays 1:00-3:00pm Phone: 645-3180 x 160
Email: hungngo@cse.buffalo.edu
Course Description:
This course has twomain components: (a) linear programming and network flows, (c) NP-completeness and approximation algorithms. We shall spend roughly one half of the semester on each topic. We shall attempt to cover a broad range of commonly faced optimization problems, mostly on graphs, which can be naturally modelled and/or solved using linear programming, network flows, and approximation techniques. In addition to that, students are expected to gain substantial discrete mathematics problem solving skills essential for computer engineers and scientists.
The textbooks are meant mainly for references. We shall cover many topics not covered in the texts. Appropriate lecture notes shall be given.
This course is highly mathematical in nature. One aim is for students to be able to formulate a practical problems mathematically, and find familiar techniques to solve them if possible.
Course Objectives:
Prerequisites:
A solid background on basic algorithms. (A formal course like CSE531 suffices.)
Ability to read and quickly grasp new discrete mathematics concepts and results.
Ability to do rigorous formal proofs.
At the end of this course, each student should be able to:
References:
Class homepage:
http://www.cse.buffalo.edu/~hungngo/classes/cse594_spring03/
Work load:
Grading policy:
Academic Honesty:
Misc. Items: