Hopsets with Constant Hopbound, and Applications to Approximate Shortest Paths

Michael Elkin, Ofer Neiman. Hopsets with Constant Hopbound, and Applications to Approximate Shortest Paths. In Irit Dinur, editor, IEEE 57th Annual Symposium on Foundations of Computer Science, FOCS 2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey, USA. pages 128-137, IEEE, 2016. [doi]

Authors

Michael Elkin

This author has not been identified. Look up 'Michael Elkin' in Google

Ofer Neiman

This author has not been identified. Look up 'Ofer Neiman' in Google