@inproceedings{d8266e43af5f470486bfdd2f9fd5c173,
title = "Fully dynamic all-Pairs shortest paths: Breaking the o(n) barrier",
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.",
keywords = "Dynamic Algorithms, Shortest Paths",
author = "Ittai Abraham and Shiri Chechik and Kunal Talwar",
note = "Publisher Copyright: {\textcopyright} Ittai Abraham, Shiei Chechik, and Kunal Talwar.; 17th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2014 and the 18th International Workshop on Randomization and Computation, RANDOM 2014 ; Conference date: 04-09-2014 Through 06-09-2014",
year = "2014",
month = sep,
day = "1",
doi = "10.4230/LIPIcs.APPROX-RANDOM.2014.1",
language = "الإنجليزيّة",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",
pages = "1--16",
editor = "Klaus Jansen and Rolim, {Jose D. P.} and Devanur, {Nikhil R.} and Cristopher Moore",
booktitle = "Leibniz International Proceedings in Informatics, LIPIcs",
address = "ألمانيا",
}