Martin Dietzfelbinger, Philipp Woelfel. Tight Lower Bounds for Greedy Routing in Higher-Dimensional Small-World Grids. In Chandra Chekuri, editor, Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014, Portland, Oregon, USA, January 5-7, 2014. pages 816-829, SIAM, 2014. [doi]
@inproceedings{DietzfelbingerW14,
title = {Tight Lower Bounds for Greedy Routing in Higher-Dimensional Small-World Grids},
author = {Martin Dietzfelbinger and Philipp Woelfel},
year = {2014},
doi = {10.1137/1.9781611973402.60},
url = {http://dx.doi.org/10.1137/1.9781611973402.60},
researchr = {https://researchr.org/publication/DietzfelbingerW14},
cites = {0},
citedby = {0},
pages = {816-829},
booktitle = {Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014, Portland, Oregon, USA, January 5-7, 2014},
editor = {Chandra Chekuri},
publisher = {SIAM},
isbn = {978-1-61197-340-2},
}