In this thesis, a 2-clustering algorithm with O(n log n) time complexity is presented.
This algorithm minimizes the maximum of the diameters of clusters, for the points in Euclidian plane.
A proof that certain problems related to min-max K-clustering are NP-Complete is also given.