On Dynamic Approximate Shortest Paths for Planar Graphs with Worst-Case Costs

Ittai Abraham, Shiri Chechik, Daniel Delling, Andrew V. Goldberg, Renato F. Werneck. On Dynamic Approximate Shortest Paths for Planar Graphs with Worst-Case Costs. In Robert Krauthgamer, editor, Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016. pages 740-753, SIAM, 2016. [doi]

Abstract

Abstract is missing.