Combinatorial Algorithms(CS 295)

The objective of this course is to provide a general, introductory course on the subject of combinatorial algorithms. We specificly emphasizes the basic techniques of generation, enumeration and search. The topics we will cover include the following: generation of elementary combinatorial objects such as subsets and permutations, backtracking with discussion of pruning methods, and the maximum clique problem is studied in details, heuristic search algorithms, including hill-climbing, simulated annealing, tabu search and genetic algorithms. If time permits, we will study algorithms for testing isomorphism of combinatorial objects.

News and Announcements

Special needs. If you are entitled to extra accommodation for any reason (such as a disability), we will make every reasonable attempt to accomodate you. However, it is your responsibility to discuss this with the instructor at the beginning of the course.