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]
@inproceedings{BernsteinR11, title = {Improved Dynamic Algorithms for Maintaining Approximate Shortest Paths Under Deletions}, author = {Aaron Bernstein and Liam Roditty}, year = {2011}, url = {http://www.siam.org/proceedings/soda/2011/SODA11_103_bernsteina.pdf}, researchr = {https://researchr.org/publication/BernsteinR11}, cites = {0}, citedby = {0}, pages = {1355-1365}, booktitle = {Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, San Francisco, California, USA, January 23-25, 2011}, editor = {Dana Randall}, publisher = {SIAM}, }