Tentative schedule (it will be updated if changes occur):
dates and tasks | Lecture Contents: | textbook
sections and extra materials |
---|---|---|
Jan 06 | Introduction to the course | Intro to NPC np.pdf (pages 1-13) course outline |
Jan 11,13 | Polynomial time reductions | Ch8.1,8.2 book slides: 08intractability.pdf |
Jan 18,20 | NP, NP-completeness | Ch8.3,8.4; CLR-Ch34 book slides: 08np-complete.pdf CIRCUITSATisNPhard.pdf |
Jan 25,27(A1 due) | Reductions: Sequencing and partitioning problems. | Ch8.5,8.6 book slides: 08reductions-poly.pdf (1-26) |
Feb 1,3 | Reductions: Graph colouring, numerical problems, partial taxonomy of hard problems. | Ch8.7,8.8, 8.10 book slides: 08reductions-poly.pdf (27-43) |
Feb 6 (SATURDAY) | Midterm test 1. | Time/location to be decided. |
Feb 8,10 | Beyond NP (co-NP, PSPACE). Project guidelines. | Ch8.9, Ch 9 |
Feb 14-20 | Study break. | |
Feb 22-26 | Classes cancelled. Project research.
(makeup time: Saturday Midterms) | Textbook, library (physical/online). |
Mar 1(PP due),3 | Backtracking. | Slides (covered sections 1)Intro,2)All cliques,5) Bounding). DS-Ch3. |
Mar 8,10(A2 due) | Extending the limits of tractability. | Ch10 (10.1,10.2,10.3) |
Mar 15,17 | Approximation algorithms. | Ch11 (11.1,11.2,11.4,11.6) |
Mar 20 (SATURDAY) | Midterm test 2. | Time/location to be decided. |
Mar 22,24 (PM&C due) | Local Search. | Ch12 |
Mar 29,31(A3 due) | Randomized Algorithms. | Ch13 |
Apr (5),7 | (Easter Monday), course overview and/or other topics. | Textbook/TBA. |
Apr 12 (PT due) | Project talks. | (Longer time period?) |
Apr ???(PR due) | Project report due. |
Background references: | textbook sections |
---|---|
Basics of algorithmic analysis | Ch2 |