1 research outputs found
Better approximation algorithm for point-set diameter
We propose a new -approximation algorithm with running time for computing the diameter of a
set of points in the -dimensional Euclidean space for a fixed dimension
, where . This result provides some improvements
in the running time of this problem in comparison with previous algorithms.Comment: arXiv admin note: substantial text overlap with arXiv:1610.0854