Improved Dynamic Algorithms for Maintaining Approximate Shortest Paths Under Deletions

Aaron Bernstein, Liam Roditty. Improved Dynamic Algorithms for Maintaining Approximate Shortest Paths Under Deletions. In Dana Randall, editor, Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, San Francisco, California, USA, January 23-25, 2011. pages 1355-1365, SIAM, 2011. [doi]

Abstract

Abstract is missing.