Lectures Fundamentals of Algorithms and Data Structures Efficient Algorithms and
Data Structures II Complexity Theory Proseminar Graph Drawing Seminar / Master Seminar Approximation-Algorithms Lab Course Discrete Optimization Courses for PhD Students Oberseminar

Exercises for Efficient Algorithms and Data Structures II

Announcements:

• The 11th exercise sheet is available.
• You can download a preprint of 'The Design of Approximation Algorithms' by DPW and DBS.

General Information:

• Teaching Assistant:
  Chintan Shah
• Tutorial - Time and Place:
  Tuesday, 14:15–15:45, MI 01.06.020
  
• Office Hours:
  Wednesday, 11:30-12:30
• Submission of Solutions to Exercises:
  Exercises are posted on this webpage on Wednesdays. You should submit solutions in English by 10:10 on Thursday of the following week, either by leaving them in the folder " EADS Tuesday" in Room No. MI 03.09.051 or by handing them personally to the teaching assistant. Solutions will be discussed in the following tutorial session. You can collect corrected solutions in the tutorial or from the folder "EAD 2 Old Assignments".

Exercises and Solutions

• Exercise 1
• Exercise 2
• Exercise 3
• Exercise 4
• Exercise 5
• Exercise 6
• Exercise 7
• Exercise 8
• Exercise 9
• Exercise 10
• Exercise 11 (Choose from Q1,Q2)