Efficient polynomial time algorithms for finding \$k\$
points with minimum variance and diameter among \$n\$
points are developed.