Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: An efficient approximation for point-set diameter in higher dimensions   In this paper, we study the problem of computing the diameter of a set of $n$
points in $d$-dimensional Euclidean space for a fixed dimension $d$, and
propose a new $(1+\varepsilon)$-approximation algorithm with $O(n+
1/\varepsilon^{d-1})$ time and $O(n)$ space, where $0 < \varepsilon\leqslant
1$. We also show that the proposed algorithm can be modified to a
$(1+O(\varepsilon))$-approximation algorithm with $O(n+
1/\varepsilon^{\frac{2d}{3}-\frac{1}{3}})$ running time. These results provide
some improvements in comparison with existing algorithms in terms of simplicity
and data structure.

11
The categories of this paper are: hep-lat
37
The categories of this paper are: supr-con
15
The categories of this paper are: nucl-ex
4
The categories of this paper are: cond-mat
33
The categories of this paper are: plasm-ph
0
The categories of this paper are: hep-ph
16
The categories of this paper are: stat
35
The categories of this paper are: mtrl-th
32
The categories of this paper are: atom-ph
7
The categories of this paper are: hep-th
22
The categories of this paper are: chao-dyn
30
The categories of this paper are: q-alg
24
The categories of this paper are: dg-ga
25
The categories of this paper are: patt-sol
2
The categories of this paper are: math
8
The categories of this paper are: hep-ex