Research Institute for Discrete Mathematics

Lecture "Approximation Algorithms"

Exercises

Summer Term 2013

Place:	Seminarraum (Arithmeum, Lennéstr. 2)
Time:	Thursday, 16:00 - 17:30
Start:	April 11th, 2013

Exercise Sheets:

• Exercise Sheet   1
• Exercise Sheet   2
• Exercise Sheet   3
• Exercise Sheet   4
• Exercise Sheet   5
• Exercise Sheet   6
• Exercise Sheet   7
• Exercise Sheet   8
• Exercise Sheet   9
• Exercise Sheet 10
• Exercise Sheet 11

Programming Exercise 1:

• Exercise and Specifications
• Sample read in
• inst1
• larger random instances

Programming Exercise 2:

• Exercise and Specifications
• Sample read in: main.C graph.h graph.C (the graph class was provided for the AlMa-Lecture and considers edges as directed)
• Sample Instance
• Larger instances: e_min.tar.gz, h_min.tar.gz (New!)

Successful participation criteria:

• At least 50% of the achievable points of all exercises.
• Regular participation including presentations of own solutions to the others.

Lecture website

Philipp Ochsendorf, M.Sc.