Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Thursday, March 03, 2022, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Christoph Grunau

A Near-Optimal Deterministic Parallel Algorithm for (1+eps)-Approximate Shortest Paths

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.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2024  2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login