Assignments for the LNMB Course Combinatorial Optimization CO1a - Fall 2010
The numbered exercises can be found in the lecture notes (version August 25, 2010):
A Course in Combinatorial Optimization, A. Schrijver,
which can be downloaded from here.
Please note that the numbering of the exercises may have changed if you are using an older version of the Lecture Notes.
BBL stands for Buys Ballotlaboratorium.
Monday September 13: [room MI 611 AB]
Exercises A,B,C here, and Exercises 1.6, 1.9.
Correction: In Exercise B, g_k(v) should be the minimum length of an (s,v)-walk traversing at most k arcs.
[So: walk instead of path.]
Monday September 20: [Room BBL 061]
Exercises 2.4, 2.5, 2.11, 2.17.
Monday September 27: [Room BBL 023]
Exercises 3.2, 3.4, 3.5, 3.7.
Monday October 4: [Room BBL 061]
Exercises 3.11, 3.25, 3.26 and Exercise D here.
Monday October 11: [Room BBL 201]
Exercises 4.2, 4.5, 4.7(i), 4.9.
Monday October 18: [Room BBL 023]
Exercise 4.15, Exercise E here, Exercises 5.1, 5.2.
Monday October 25: [Room BBL 061]
Exercises 5.7 (iii), 5.9.
Please take a look at the notes
here,
here,
here,
which contain details about the notation to be used at the next lecture
for the minimum weight perfect matching algorithm.
The notes
here,
here,
here
might also be useful for the next lecture.
Monday November 1: [Room BBL 201]
Exercise 5.8 (i) and Exercise F.
Monday November 8: [Room BBL 061]
Exercises 5.11, 5.20, 5.22, 5.23.
The exercises can be handed in after the end of the course.
The deadline to send the exercises is December 15, 2010.
Please mail them to Monique Laurent, CWI,
Science Park 123, 1098 XG Amsterdam
or email them to: M.Laurent at cwi dot nl
(pdf file or postscript file - thus no doc file)