BARC talk by Danupon Nanongkai
On Friday, October 26th associate professor Danupon Nanongkai, KTH Royal Institute of Technology, Sweden, will give a talk in BARC "Distributed Shortest Paths, Exactly"
Distributed Shortest Paths, Exactly
This talk concerns the problem of quickly computing distances and shortest paths on distributed networks (the CONGEST model). There have been many developments for this problem in the last few year, resulting in tight approximation schemes. This left open whether exact algorithms can perform equally well. In this talk, we will discuss some recent progress in answering this question.
Most recent works that this talk is based on are with Sebastian Krinninger (FOCS 2018) and Aaron Bernstein (Work in progress).
Read more about Danupon Nanongkai