Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Distributed Approximation Algorithms for the Multiple Knapsack Problem   We consider the distributed version of the Multiple Knapsack Problem (MKP),
where $m$ items are to be distributed amongst $n$ processors, each with a
knapsack. We propose different distributed approximation algorithms with a
tradeoff between time and message complexities. The algorithms are based on the
greedy approach of assigning the best item to the knapsack with the largest
capacity. These algorithms obtain a solution with a bound of $\frac{1}{n+1}$
times the optimum solution, with either $\mathcal{O}\left(m\log n\right)$ time
and $\mathcal{O}\left(m n\right)$ messages, or $\mathcal{O}\left(m\right)$ time
and $\mathcal{O}\left(mn^{2}\right)$ messages.

2
The categories of this paper are: math
3
The categories of this paper are: physics
5
The categories of this paper are: gr-qc
10
The categories of this paper are: q-bio
15
The categories of this paper are: nucl-ex
23
The categories of this paper are: solv-int
18
The categories of this paper are: econ
4
The categories of this paper are: cond-mat
0
The categories of this paper are: hep-ph
37
The categories of this paper are: supr-con
28
The categories of this paper are: alg-geom
13
The categories of this paper are: quant-ph
6
The categories of this paper are: astro-ph
9
The categories of this paper are: nlin
34
The categories of this paper are: chem-ph
30
The categories of this paper are: q-alg