Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrier and Derandomization

Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrier and Derandomization

Additional Information

https://arxiv.org/abs/1308.0776

Grafik Top
Authors
  • Henzinger, Monika
  • Krinninger, Sebastian
  • Nanongkai, Danupon
Grafik Top
Shortfacts
Category
Paper in Conference Proceedings or in Workshop Proceedings (Paper)
Event Title
FOCS 2013 54th Annual IEEE Symposium on Foundations of Computer Science
Divisions
Theory and Applications of Algorithms
Subjects
Datenstrukturen
Theoretische Informatik
Event Location
Berkeley, USA
Event Type
Conference
Event Dates
October 27-29, 2013
Publisher
IEEE
Date
October 2013
Export
Grafik Top