Conference paper
On minimum and maximum spanning trees of linearly moving points
Naoki Katoh, Takeshi Tokuyama, et al.
FOCS 1992
Paper
Finding k points with minimum diameter and related problems
Abstract
Let S be a set consisting of n points in the plane. We consider the problem of finding k points of S that form a "small" set under some given measure, and present efficient algorithms for several natural measures including the diameter and the variance. © 1991.
Related
Narihiro Park, Hiroyuki Okano, et al.
Journal of the Operations Research Society of Japan
Alok Aggarwal, Herbert Edelsbrunner, et al.
Information Processing Letters
Alok Aggarwal, Ashok K. Chandra, et al.
Theoretical Computer Science