Fully dynamic all-Pairs shortest paths: Breaking the o(n) barrier

Ittai Abraham, Shiri Chechik, Kunal Talwar

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

A fully dynamic approximate distance oracle is a distance reporting data structure that supports dynamic insert edge and delete edge operations. In this paper we break a longstanding barrier in the design of fully dynamic all-pairs approximate distance oracles. All previous results for this model incurred an amortized cost of at least Ω (n) per operation. We present the first construction that provides constant stretch and o(m) amortized update time. For graphs that are not too dense (where |E| = O(|V |2-δ) for some δ > 0) we break the O(n) barrier and provide the first construction with constant stretch and o(n) amortized cost.

Original languageEnglish
Title of host publicationLeibniz International Proceedings in Informatics, LIPIcs
EditorsKlaus Jansen, Jose D. P. Rolim, Nikhil R. Devanur, Cristopher Moore
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Pages1-16
Number of pages16
ISBN (Electronic)9783939897743
DOIs
StatePublished - 1 Sep 2014
Externally publishedYes
Event17th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2014 and the 18th International Workshop on Randomization and Computation, RANDOM 2014 - Barcelona, Spain
Duration: 4 Sep 20146 Sep 2014

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume28
ISSN (Print)1868-8969

Conference

Conference17th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2014 and the 18th International Workshop on Randomization and Computation, RANDOM 2014
Country/TerritorySpain
CityBarcelona
Period4/09/146/09/14

Keywords

  • Dynamic Algorithms
  • Shortest Paths

Fingerprint

Dive into the research topics of 'Fully dynamic all-Pairs shortest paths: Breaking the o(n) barrier'. Together they form a unique fingerprint.

Cite this