Summer School on Shortest Paths - Between Algorithms and Optimization

This summer school on shortest paths will span theory, practice, and applications in optimization problems. We will cover single source and all pairs shortest paths in directed and undirected graphs; with exact and approximate solutions; combinatorial techniques, the use of matrix multiplication, and exploiting integer weights; fast generation of distance oracles; dynamic versions where distances are quickly recomputed when the graph updated; and various NP-hard variants of shortest path problems. Finally, we will give an overview on how shortest paths are used as subproblems in other combinatorial optimization problems.
The summer school will be held at DIKU, University of Copenhagen.
State-of-the-art lectures will be given by the foremost researchers in the field, ensuring a proper balance between algorithms and optimization. The lectures will be supplemented by exercises and discussions.
Confirmed speakers
* Natashia Boland, The University of Melbourne, Australia
* Camil Demetrescu, University of Rome, Italy
* Andrew Goldberg, Microsoft Research, Silicon Valley, California
* Pino Italiano, University of Rome, Italy
* Mikkel Thorup, AT&T Labs, New Jersey
* Uri Zwick, Tel Aviv University, Israel