ACM Symposium on Discrete Algorithms, SODA 2014


Article Details
Title: Tight Lower Bounds for Greedy Routing in Higher-Dimensional Small-World Grids
Article URLs:
Alternative Article URLs:
Authors: Martin Dietzfelbinger
  • Technische Universität Ilmenau, 98684 Ilmenau, Germany, Faculty of Computer Science and Automation
Philipp Woelfel
  • University of Calgary, Calgary, AB, Department of Computer Science
Sharing: Unknown
Verification: Authors have not verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers:
DBLP Key: conf/soda/DietzfelbingerW14
Author Comments:

Discuss this paper and its artifacts below