Tetsuo Shibuya, Hiroshi Imai, et al.
IEICE Transactions on Information and Systems
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
Alok Aggarwal, Don Coppersmith, et al.
SIAM Journal on Computing
Alok Aggarwal, Heather Booth, et al.
Information and Computation
Alok Aggarwal, Ashok K. Chandra, et al.
Theoretical Computer Science