Most or all homework questions will be from the textbook, Algorithm Design, by Kleinberg and Tardos. The links below will be dead until I post the assignments, and I will announce on the course home page when I post each one.
Homework is due in (lecture) class, on paper on the date indicated, unless specific alternate arrangements are made with the TA. Late papers will in general not be accepted. Students with major extenuating circumstances should contact the instructor. There will be two homeworks for each of the three sections of the course. The lowest of the six homework grades will not be counted.
Some homework problems will be individual and others will be group -- homework groups will be established early in the course and each group will submit only one copy of the group problems.
Students are responsible for understanding and following the academic honesty policies indicated on this page.
Homework 1, posted Thursday 7 September 2006, due in class Monday 18 September 2006
Homework 2, posted Monday 18 September 2006, due in class Monday 2 October 2006
Homework 3, posted Tuesday 10 October 2006, due in class Monday 23 October 2006
Homework 4, posted Tuesday 24 October 2006, due in class Monday 6 November 2006
Homework 5, posted Monday 13 November 2006, due in class Wednesday 29 November 2006
Last modified 29 November 2006