CSE 550 Fall 2014
Combinatorial Algorithms and Intractability Syllabus
This document is available at http://www.public.asu.edu/~ccolbou/src/550syllabusf14.html

CSE 550 is a graduate course on combinatorial algorithms. Topics include: shortest paths and minimum spanning trees, linear programming, bipartite matching and covers, network flows, general matching, NP-completeness and intractability, cliques and colourings, and integer programming.

The grading is as follows:

General Course Information:

Students may discuss homework assignments with their classmates; however all work turned in is expected to be that of the individual. If you have any questions regarding appropriate collaboration please see the instructor. Penalties for plagiarism and other forms of academic dishonesty can include a grade of zero on the offending item, a reduction of the final letter grade in the course, or both. Infractions can result in failure in the course with a transcript designation of academic dishonesty. Repeat offenses can result in expulsion from the program.

The emphasis on the tests will be the same as that in the lectures. Hence, although class attendance is not required, it is highly recommended.