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

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Ittai Abraham' in GoogleThis author has not been identified. Look up 'Shiri Chechik' in GoogleThis author has not been identified. Look up 'Daniel Delling' in GoogleThis author has not been identified. Look up 'Andrew V. Goldberg' in GoogleThis author has not been identified. Look up 'Renato F. Werneck' in Google

runs on WebDSL