Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: A $(k + 3)/2$-approximation algorithm for monotone submodular
  maximization over a $k$-exchange system   We consider the problem of maximizing a monotone submodular function in a
$k$-exchange system. These systems, introduced by Feldman et al., generalize
the matroid k-parity problem in a wide class of matroids and capture many other
combinatorial optimization problems. Feldman et al. show that a simple
non-oblivious local search algorithm attains a $(k + 1)/2$ approximation ratio
for the problem of linear maximization in a $k$-exchange system. Here, we
extend this approach to the case of monotone submodular objective functions. We
give a deterministic, non-oblivious local search algorithm that attains an
approximation ratio of $(k + 3)/2$ for the problem of maximizing a monotone
submodular function in a $k$-exchange system.

24
The categories of this paper are: dg-ga
5
The categories of this paper are: gr-qc
16
The categories of this paper are: stat
19
The categories of this paper are: eess
34
The categories of this paper are: chem-ph
0
The categories of this paper are: hep-ph
27
The categories of this paper are: comp-gas
26
The categories of this paper are: bayes-an
11
The categories of this paper are: hep-lat
25
The categories of this paper are: patt-sol
12
The categories of this paper are: nucl-th
30
The categories of this paper are: q-alg
35
The categories of this paper are: mtrl-th
9
The categories of this paper are: nlin
36
The categories of this paper are: cmp-lg
2
The categories of this paper are: math