Tuesday, April 3, 2018

[DMANET] Summer School on Combinatorial Optimization (deadline for applications: April 30)

Summer School on Combinatorial Optimization

August 20-24, 2018 in Bonn, Germany

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:

- 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

Limited financial support for PhD students and postdocs available.
Application deadline: April 30, 2018

Application and more information:

Organizers: Jochen Könemann, Jens Vygen
Hausdorff Center for Mathematics, Bonn

* Contributions to be spread via DMANET are submitted to
* DMANET@zpr.uni-koeln.de
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/