MA-INF 1307 - Seminar Advanced Algorithms

General Information

When Where Start Lecturer
Monday, 10:30-12:00 LBH / Room E.08 October 26 Röglin, Mnich

The kick-off meeting, in which the topics will be assigned, will take place on October 26 at 10:30.

When Who Topic
December 7 Lukas Miething Online Stochastic Matching: Beating 1-1/e
January 11 Alexander Göke Robust Randomized Matchings
January 18 Robin Suter Randomized Greedy Algorithms for the Maximum Matching Problem with New Analysis
January 18 Geraldine Reichard A proof of the Boyd-Carr Conjecture
January 25 Kevin Wilkinghoff Uncoordinated Two-Sided Matching Markets
January 25 Paul Görlach Approximating the k-Set Packing Problem by Local Improvements
February 1 Marina Mircheska An Optimal Online Algorithm for Weighted Bipartite Matching and Extensions to Combinatorial Auctions

Contents

The focus of the seminar will be on algorithmic questions related to matching problems.

Preliminary list of relevant papers: