An $O(n\log n)$ algorithm for finding a $k$-point subset with minimal $L_\infty$-diameter

Michiel Smid
Tech. report MPI-I-93-116, Max-Planck-Inst. für Informatik, 1993

Cites:

Fano Experimental Web Server, D. Eppstein, School of Information & Computer Science, UC Irvine
Made on a Mac Valid XHTML 1.0!