COMP-362: Honours Algorithm Design

Fall 2008

Time:	Tuesday and Thursday from 11:30am to 1:00pm
Room:	ENGTR 2100 (Trottier building)
Instructor:	Prof. Patrick Hayden
Office:	108N McConnell
Phone:	398-5491
Office hours:	Thursday from 1:00pm to 3:00pm
Email:	patrick@cs.mcgill.ca

Teaching assistants:

Julia Evans (julia.evans@mail.mcgill.ca)

Office hours: Monday 2:30pm to 4:30pm in Trottier 3106

Topics:

Dynamic programming. Linear and integer linear programming. Graph algorithms: shortest paths, flows and matchings. NP-complete problems. Approximation algorithms. Fixed-parameter tractability. (3 credits)

Grading:

~5 homework assignments:	35%		25%
Midterm exam:	15%	or	0%
Final exam:	50%		75%

Course web page: http://www.cs.mcgill.ca/~patrick/cs362/2008A

Further materials, including a course discussion area, can be accessed through the Web CT Vista system:

Visit http://www.mcgill.ca/mycourses and log in using your McGill ID.

Topics and readings lecture by lecture:

http://www.cs.mcgill.ca/~patrick/cs362/2008A/readings.html

Other resources:

Lecture outlines from: 2003, 2004, 2005.

In case you haven’t heard:

McGill University values academic integrity. Therefore all students must understand the meaning and consequences of cheating, plagiarism and other academic offences under the Code of Student Conduct and Disciplinary Procedures. (See http://www.mcgill.ca/integrity for more information.)

Course textbooks:

Required: Algorithm Design

by Kleinberg and Tardos

Recommended: Introduction to Algorithms, 2/e

by Cormen, Leiserson, Rivest and Stein

Available free online from McGill or using VPN. Free registration required.

http://library.books24x7.com/toc.asp?bookid=3444