Yao, Andrew Chi-Chih On constructing minimum spanning trees in k-dimensional spaces and related problems. (English) Zbl 0492.68050 SIAM J. Comput. 11, 721-736 (1982). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 1 ReviewCited in 107 Documents MSC: 68R10 Graph theory (including graph drawing) in computer science 68W99 Algorithms in computer science Keywords:nearest neighbor; post office problem PDF BibTeX XML Cite \textit{A. C. C. Yao}, SIAM J. Comput. 11, 721--736 (1982; Zbl 0492.68050) Full Text: DOI