1. Awerbuch, B., Baratz, A., Peleg, D.: Efficient broadcast and light weight spanners. Tech. Report CS92-22, Weizmann Institute of Science (1992)
2. Aingworth, D., Chekuri, C., Indyk, P., Motwani, R.: Fast estimation of diameter and shortest paths(without matrix multiplication). SIAM Journal on Computing 28, 1167–1181 (1999)
3. Althöfer, I., Das, G., Dobkin, D.P., Joseph, D., Soares, J.: On sparse spanners of weighted graphs. Discrete and Computational Geometry 9, 81–100 (1993)
4. Awerbuch, B.: Complexity of network synchronization. Journal of Association of Computing Machinery 32(4), 804–823 (1985)
5. Bollobás, B., Coppersmith, D., Elkin, M.: Sparse distance preserves and additive spanners. In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 414–423 (2003)