back to CSI 4105 home

Lecture Contents

Chapter sections refer to the textbook by Kleinberg and Tardos (2005).
CLR refers to the book by Cormen, Leiserson and Rivest (2001)
DS refers to the book by Kreher and Stinson (1998).


(Very) Tentative schedule (earlier material expected to go more quickly than stated):
dates and tasks  Lecture Contents: textbook sections
and extra materials
Jan 11-13 Introduction to the course
Polynomial time reductions.
Intro to NPC np.pdf (pages 1-13)
course outline
book slides: 08intractability.pdf
Jan 18-20 Polynomial time reductions, NP, NP-completeness Ch 8.2, 8.3
book slides: 08intractability.pdf
Jan 25-27 NP, NP-completeness CLR-Ch34, Ch8.3,8.4; CLR-Ch34
book slides: 08np-complete.pdf
Feb 1-3 Reductions: Sequencing and partitioning problems. Ch8.5,8.6
book slides: 08reductions-poly.pdf (1-26)
Feb 8-10 Reductions: Graph colouring, numerical problems,
partial taxonomy of hard problems.
Ch8.7,8.8, 8.10
book slides: 08reductions-poly.pdf (27-43)
Feb 15-17 Beyond NP (co-NP, PSPACE). Project guidelines.
Midterm Test.
Ch8.9, Ch 9
Feb 22-24 study break
Feb 29-Mar 2 (still covering material from list above)
Mar 7-9 Backtracking. slides on backtracking
(covered sections 1)Intro,2)All cliques,3) Estimating tree size. DS-Ch3.
Mar 14-16 Approximation algorithms. Ch11 (11.1,11.2)
Mar 21-23 Midterm test 2.
Mar 28-30 (A3 due) Local Search. Ch12
April 4-6 (Talks?) Randomized Algorithms. (Project Talks?) Ch13
Background references: textbook sections
Basics of algorithmic analysis Ch2