Alok Aggarwal, Jon Kleinberg, et al.
SIAM Journal on Computing
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
Pankaj K. Agarwal, Alok Aggarwal, et al.
Discrete Applied Mathematics
Conference paper
On minimum and maximum spanning trees of linearly moving points
Naoki Katoh, Takeshi Tokuyama, et al.
FOCS 1992
Alok Aggarwal, Don Coppersmith, et al.
SIAM Journal on Computing