CSI 5165 (COMP 5709) Fall 2013 course description

WEB PAGE: http://www.eecs.uottawa.ca/~lucia/courses/5165-13/
PROFESSOR: Lucia Moura
tel: 562-5800 ext. 6678
email: lucia@eecs.uottawa.ca
OFFICE HOURS: Office: SITE 5-027 
Wednesdays 1:30-2:30
LECTURES: Wednesdays 10:00-1:00 (LEE B152)

TEXTBOOK: Textbook:
[KS] D. Kreher and D. Stinson, "Combinatorial Algorithms: generation, enumeration and search", CRC Press, 1998. (The textbook is required)

Reference book:
[KO] P. Kaski and P. Ostergard, Classification algorithms for codes and designs, Springer, 2006.
Paper copy available at Carleton University library.
OttawaU electronic resources:
go to "connect to Springer resource" for individual chapter's pdf"

Combinatorial problems arise in many areas of computer science, engineering and mathematics. Combinatorial structures such as graphs and set systems are used to model many problems in computing.
In this course, we will study combinatorial algorithms to solve the following types of problem:
Generation: construct all combinatorial structures of a particular type.
Enumeration: compute the number of different combinatorial structures of a particular type.
Search/Optimization: find at least one example of a structure of a particular type; optimization can be viewed as a special case of search.
In the first part of the course, students will learn a wide range of techniques to solve these problems. In the second part, they will learn more advanced techniques as well as work on a project related to their research interests.
  1. [G] Generating elementary combinatorial objects. Basic algorithms for ordering, ranking and unranking of combinatorial objects such as sets, permutations, tuples, gray codes. -- [KS, Chapters 2 and 3]
  2. [B] Exhaustive search and exhaustive generation algorithms (backtracking, branch-and bound). -- [KS, Chapter 4]
  3. [H] Heuristic search algorithms (hill climbing, simulated annealing, tabu search, genetic algorithms). -- [KS, Chapter 5]
  4. [I] Computing isomorphism (isomorphism of graphs and set systems; computing invariants and certificates) and Isomorph-free generation (exhaustive generation of complete (isomorph-free) lists of combinatorial objects) [KS,Chapter 7] and [KO, Chapter 3,4]

MARKING SCHEME: 45% Assignments (3 @ 15% each)
05% Project proposal (up to 1 page)
40% Project report (10-15 pages)
10% Project Talk (20 minute)


weight: due date: (tentative)
Assignment 1 15%  Oct 2
Project proposal 5%  Oct 23
Assignment 2 15%  Oct 30
Assignment 3 15%  Nov 20
Project Talk 10%  Nov 27.
Project Report 40%  December (to be decided)

Dates from the University of Ottawa Academic Calendar:
First lecture: September 4
Study break: October 13-19
Last date to drop: November 15
Last lecture: November 30