|
Distributed Shortest Paths, Exactly| old_uid | 17365 |
|---|
| title | Distributed Shortest Paths, Exactly |
|---|
| start_date | 2019/02/19 |
|---|
| schedule | 11h |
|---|
| online | no |
|---|
| location_info | salle 3052 |
|---|
| summary | 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 (ArXiv 2018). |
|---|
| responsibles | Hamoudi |
|---|
| |
|