@inproceedings{8e29861e461d41e4938bfc63d865379f,
title = "Improved dynamic algorithms for maintaining approximate shortest paths under deletions",
abstract = "We present the first dynamic shortest paths algorithms that make any progress beyond a longstanding O(n) update time barrier (while maintaining a reasonable query time), although it is only progress for not-too-sparse graphs. In particular, we obtain new decremental algorithms for two approximate shortest-path problems in unweighted, undirected graphs. Both algorithms are randomized (Las Vegas).",
author = "Aaron Bernstein and Liam Roditty",
year = "2011",
doi = "https://doi.org/10.1137/1.9781611973082.104",
language = "الإنجليزيّة",
isbn = "9780898719932",
series = "Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms",
pages = "1355--1365",
booktitle = "Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011",
}