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

Fano Experimental Web Server, D. Eppstein, School of Information & Computer Science, UC Irvine