On all the written homework assignments, when you are asked to give an algorithm,
in addition to the algorithm, you must also give (a) a proof of its correctness and
(b) an analysis of its complexity.
All homework assignments are from Kleinberg and Tardos, 1st edition, unless otherwise stated.
- (Will be assigned as the semester progresses.)
|