|CSI 4105.||DESIGN AND ANALYSIS OF ALGORITHMS II (3 hs of lecture
Theory of NP-completeness, methods for dealing with NP-complete problems. Selected topics in such areas as combinatorial optimization, computational geometry, cryptography, parallel algorithms.
Prerequisite: CSI 3105
tel: 562-5800 ext. 6678
|OFFICE HOURS:||Office: SITE 5-027
Wednesdays 10:15-11:15, Thursdays 16:00-17:00
|LECTURES:||Place: SMD 222
Tuesdays 16:00 - 17:30; Thursdays 14:30 - 16:00
|TEXTBOOK:||Kleinberg and Tardos, Algorithm
Design, Addison Wesley, 2005. ISBN
0-321-29535-8. (Chapters 8-13)
It will be available at: the University of Ottawa Bookstore .
|Cormen, Leiserson and Rivest, Introduction to Algorithms,
2nd ed., 2001.
(Chapter 34 NP-completeness
and Chapter 35 Approximation Algorithms; for 1st ed. 1990: Chapters 36
and 37) This was the previous textbook for this course.
Kreher and Stinson, Combinatorial algorithms: generation, enumeration and search, CRC Press, 1998 (Chapter 3 Backtracking, Chapter 4: Heuristic searches).
Garey and Johnson, Computers and Intractability,
|COURSE OUTLINE:||Part I: Introduction to the theory of NP-completeness
References: my lecture notes (5 lectures available from my web page) and Textbook Chapters 8 and 9.
Introduction to the course. Problems, encodings, formal languages, computational models and algorithms. Polynomial time and the complexity class P. Polynomial verification and the complexity class NP. NP-completeness and reducibility. NP-completeness proofs. NP-completeness of various problems. The complexity class PSPACE.
Part II: Methods for dealing with NP-complete problems
References: Texbook Chapters 10,11,12 and13, and some topics from other resources. Algorithms from the following topics will be covered:
|MARKING SCHEME:||25% Midterm exam (M)
45% Final exam (F)
30% Assignments average (A)
Final Grade (G):
First lecture: January 5
Study break: February 20-24
Last date to drop: March 3
Last lecture: April 6
Final Exam Period: April 11-30, 2006