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]
@inproceedings{ElkinN16-0, title = {Hopsets with Constant Hopbound, and Applications to Approximate Shortest Paths}, author = {Michael Elkin and Ofer Neiman}, year = {2016}, doi = {10.1109/FOCS.2016.22}, url = {http://dx.doi.org/10.1109/FOCS.2016.22}, researchr = {https://researchr.org/publication/ElkinN16-0}, cites = {0}, citedby = {0}, pages = {128-137}, booktitle = {IEEE 57th Annual Symposium on Foundations of Computer Science, FOCS 2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey, USA}, editor = {Irit Dinur}, publisher = {IEEE}, isbn = {978-1-5090-3933-3}, }