Approximation and Inapproximability Results for Maximum Clique of Disc Graphs in High Dimensions

Peyman Afshani, Hamed Hatami

We prove algorithmic and hardness results for the problem of finding the largest set of a fixed diameter in the Euclidean space. In particular, we prove that if $A^{\ast }$ is the larges…