Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Thursday, March 03, 2022, 12:15 pm
Duration: 30 minutes
Location: CAB G51
Speaker: Christoph Grunau
In this talk, I'm gonna present a near-optimal deterministic parallel algorithm for computing (1+eps)-approximate single-source shortest paths in any undirected weighted graph. The high-level idea of the algorithm is a local iterative approach to reduce shortest path computiations "up to distance D" to computing low-diameter decompositions "up to distance D/2". The algorithm also makes use of a boosting framework for transshipment (see Goran's talk). The presented result is based on joint work with Vaclav Rozhon, Bernhard Haeupler, Goran Zuzic and Jason Li.
Automatic MiSe System Software Version 1.4803M | admin login