1. Cowen, L.J.: Compact routing with minimum stretch. In: Proceedings of the 10th Annual ACM Symposium on Discrete Algorithms (SODA), ACM/SIAM, pp. 255–260 (1999)
2. Thorup, M., Zwick, U.: Compact routing schemes. In: Proceedings of the 13th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp. 1–10 (2001)
3. Gavoille, C., Gengler, M.: Space-efficiency of routing schemes of stretch factor three. In: Krizanc, D., Widmayer, P. (eds.) Proceedings of the 4th International Colloquium on Structual Information & Communication Complexity (SIROCCO), pp. 162–175. Carleton Scientific (1997)
4. Iwama, K., Kawachi, A.: Compact routing with stretch factor of less than three. In: Proceedings of the 19th Annual ACM Symposium on Principles of Distributed Computing (PODC), p. 337. ACM PRESS, New York (2000); A longer version in 21th IASTED PDCS, pp. 223–228 (2000)
5. Karger, D.R., Ruhl, M.: Finding nearest neighbors in growth-restricted metrics. In: Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC), pp. 741–750 (2002)