Hausdorff School on Combinatorial Optimization

Dates: August 20 - 24, 2018

Venue: Arithmeum (Gerhard-Konow-Hörsaal)

Organizers: Jochen Könemann (Waterloo), Jens Vygen (Bonn)


In this summer school, leading experts present recent progress on classical combinatorial optimization problems, utilizing a variety of new techniques. Each of the five invited speakers teaches a mini-course spanning three lectures. We cover the following topics:

  • Jaroslaw Byrka (Wroclaw): Hard variants of k-median clustering
  • Neil Olver (Amsterdam): Designing networks under uncertain demands
  • Laura Sanità (Waterloo): Approximation algorithms for tree augmentation
  • Ola Svensson (Lausanne): Approximation algorithms for the traveling salesman problem
  • László Végh (London): Strongly polynomial algorithms and generalized flows

In case you are interested in participating, please fill out the application form. Limited financial support is available. The deadline for applications is 30th April 2018. Applicants will be notified in early May. Late applications may be considered until the summer school is fully booked.