Aldous, D. J. (2009). The shape theorem for route-lengths in connected spatial networks on random points. Preprint. Available at http://arvix.org/abs/0911.5301v1.
Aldous, D. J. and Kendall, W. S. (2008). Short-length routes in low-cost networks via Poisson line patterns. Adv. Appl. Prob.
Aldous, D. J. and Shun, J. (2010). Connected spatial networks over random points and a route-length statistic. Statist. Sci.
Athreya, S., Roy, R. and Sarkar, A. (2008). Random directed trees and forest-drainage networks with dependence. Electron. J. Prob.
Baccelli, F. and Bordenave, C. (2007). The radial spanning tree of a Poisson point process. Ann. Appl. Prob.
Bhatt, A. G. and Roy, R. (2004). On a random directed spanning tree. Adv. Appl. Prob.
Bonichon, N., Gavoille, C., Hanusse, N. and Ilcinkas, D. (2010). Connections between theta-graphs, Delaunay triangulations, and orthogonal surfaces. In Graph Theoretic Concepts in Computer Science (Lecture Notes Comput. Sci. 6410), Springer, Berlin, pp. 266–278.
Bordenave, C. (2008). Navigation on a Poisson point process. Ann. Appl. Prob.
Clarkson, K. L. (1987). Approximation algorithms for shortest path motion planning. In STOC '87: Proc. 19th Annual ACM Symp. on Theory of Computing, ACM, New York, pp. 56–65.
Ferrari, P. A., Fontes, L. R. G. and Wu, X.-Y. (2005). Two-dimensional Poisson trees converge to the Brownian web. Ann. Inst. H. Poincaré Prob. Statist.
Kallenberg, O. (1997). Foundations of Modern Probability. Springer, New York.
Keil, J. M. (1988). Approximating the complete Euclidean graph. In SWAT 88 (Halmstad, 1988; Lecture Notes Comput. Sci. 318), Springer, Berlin, pp. 208–213.
Li, X.-Y., Wan, P.-J. and Wang, Y. (2001). Power efficient and sparse spanner for wireless ad hoc networks. In Proc. IEEE 10th Internat. Conf. on Computer Communications and Networks, pp. 564–567.
Penrose, M. D. and Wade, A. R. (2006). On the total length of the random minimal directed spanning tree. Adv. Appl. Prob.
Petrov, V. V. (1975). Sums of Independent Random Variables. Springer, New York.
Ruppert, J. and Seidel, R. (1991). Approximating the d-dimensional complete Euclidean graph. In 3rd Canadian Conf. Computational Geometry, pp. 207–210.
Yao, A. C. (1982). On constructing minimum spanning trees in k-dimensional spaces and related problems. SIAM J. Comput.