Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Interlaced Greedy Algorithm for Maximization of Submodular Functions in
  Nearly Linear Time   A deterministic approximation algorithm is presented for the maximization of
non-monotone submodular functions over a ground set of size $n$ subject to
cardinality constraint $k$; the algorithm is based upon the idea of interlacing
two greedy procedures. The algorithm uses interlaced, thresholded greedy
procedures to obtain tight ratio $1/4 - \epsilon$ in $O \left(
\frac{n}{\epsilon} \log \left( \frac{k}{\epsilon} \right) \right)$ queries of
the objective function, which improves upon both the ratio and the quadratic
time complexity of the previously fastest deterministic algorithm for this
problem. The algorithm is validated in the context of two applications of
non-monotone submodular maximization, on which it outperforms the fastest
deterministic and randomized algorithms in prior literature.

22
The categories of this paper are: chao-dyn
20
The categories of this paper are: acc-phys
19
The categories of this paper are: eess
26
The categories of this paper are: bayes-an
6
The categories of this paper are: astro-ph
24
The categories of this paper are: dg-ga
21
The categories of this paper are: adap-org
3
The categories of this paper are: physics
31
The categories of this paper are: ao-sci
10
The categories of this paper are: q-bio
16
The categories of this paper are: stat
4
The categories of this paper are: cond-mat
2
The categories of this paper are: math
5
The categories of this paper are: gr-qc
14
The categories of this paper are: math-ph
37
The categories of this paper are: supr-con