A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths

A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths

Additional Information

https://arxiv.org/abs/1504.07056

Grafik Top
Authors
  • Henzinger, Monika
  • Krinninger, Sebastian
  • Nanongkai, Danupon
Grafik Top
Shortfacts
Category
Paper in Conference Proceedings or in Workshop Proceedings (Paper)
Event Title
STOC 2016: 48th Annual Symposium on the Theory of Computing
Divisions
Theory and Applications of Algorithms
Subjects
Theoretische Informatik
Event Location
Cambridge, MA, USA
Event Type
Conference
Event Dates
19-21 Jun 2016
Date
June 2016
Export
Grafik Top