LFCS seminar: Danupon Nanongkai: Challenges in distributed shortest paths algorithms
—
filed under:
LFCS Seminar,
Upcoming events
What |
|
---|---|
When |
Sep 12, 2017 from 04:00 PM to 05:00 PM |
Where | IF 4.31/4.33 |
Add event to calendar |
![]() ![]() |
This talk focuses on the current challenges in computing distances and shortest paths on distributed networks (the CONGEST model), in particular exact algorithms and the directed case. I will survey previous results and techniques, and try to point out where previous techniques fail, and where major new ideas are needed.
This talk will touch results I (co-)authored in STOC 2014, STOC 2016, and FOCS 2017, among others.