Das, Gautam Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Smid, Michiel Algorithms and Complexity, MPI for Informatics, Max Planck Society;
http://www.cccg.ca/proceedings/1996/cccg1996_0027.pdf (Any fulltext)
Chen, D. Z., Das, G., & Smid, M. (1996). Lower Bounds for Computing Geometric Spanners and Approximate Shortest Paths. In F. Fiala, E. Kranakis, & J.-R. Sack (Eds.), Proceedings of the 8th Canadian Conference on Computational Geometry (pp. 155-160). Ottawa: Carleton University Press.
