Smid, Michiel Algorithms and Complexity, MPI for Informatics, Max Planck Society;
MPI-I-93-116.pdf (Verlagsversion), 12MB
Smid, M.(1993). An O(n log n) algorithm for finding a k-point subset with minimal L∞-diameter (MPI-I-93-116). Saarbrücken: Max-Planck-Institut für Informatik.