Lecture: Combinatorial Optimization (MA-INF 1102)

Sommersemester/Summerterm 2013

We shall start with algorithms for matching problems in nonbipartite graphs. Hence, we assume at the beginning of the first lecture that everyone knows the contents of the lecture notes "Pearls of Algorithms" pp. 1-11.

Termin:

Tue/Thu, 8ct-10am, room II.57 (LBH); room changed!

Requirements:

The first part of Pearls of Algorithms taught by Prof. N. Blum.

• Bipartite Matching
• Weighted Bipartite Matching
• Maximum Flow Problem

Exams:

• oral exams
• Tuesday July, 23th and Tuesday July, 30th
• Please contact Matthias Kretschmer to get the your date.

Exams (2nd try):

• oral exams
• Tuesday October, 8th and Wednesday October, 9th
• Please contact Elena Trunz to get the your date.

Lecture Notes

• Part 1
• Part 2
• Part 3
• Part 4 (updated version from May, 13th)
• Part 5
• Part 6
• Part 7 (updated version from June, 13th)
• Part 8
• Part 9
• Part 10
• Part 11
• Part 12
• Part 13

Tutorials:

• Tutorials are organized using the Tutorienvergabesystem. Registration by the system is only possible using an IP-address which belongs to the university network (use a computer on campus or the VPN). Registration to the lecture can be done using any device from any IP-address.
• Registration is open until 17th of April, 12:00h
• Contact: schwalb@cs.uni-bonn.de
• Homeworks

Fragen?/Questions?

Bei Fragen wenden Sie sich bitte an Matthias Kretschmer.

Please contact Matthias Kretschmer in case of questions.