Better approximation algorithm for point-set diameter

Mahdi Imanparast, Seyed Naser Hashemi

We propose a new $(1+O(\epsilon ))$-approximation algorithm with $O(n+1/{\epsilon }^{\frac{(d-1)}{2}})$ running time for computing the diameter of a set of $n$ points in the $d$…