Inapproximability of Maximum Diameter Clustering for Few Clusters

Even when the number of clusters is fixed to 3, the Maximum Diameter Clustering problem is NP-hard to approximate within a factor of 1.5 in the ℓ1-metric and 1.304 in the Euclidean metric.