Inapproximability of Maximum Diameter Clustering for Few Clusters

Henry Fleischmann, Kyrylo Karlov, Karthik C. S. +2

In the Max-k-diameter problem, we are given a set of points in a metric space, and the goal is to partition the input points into k parts such that the maximum pairwise distance be…