Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Large Neighborhood Local Search for the Maximum Set Packing Problem   In this paper we consider the classical maximum set packing problem where set
cardinality is upper bounded by $k$. We show how to design a variant of a
polynomial-time local search algorithm with performance guarantee $(k+2)/3$.
This local search algorithm is a special case of a more general procedure that
allows to swap up to $\Theta(\log n)$ elements per iteration. We also design
problem instances with locality gap $k/3$ even for a wide class of exponential
time local search procedures, which can swap up to $cn$ elements for a constant
$c$. This shows that our analysis of this class of algorithms is almost tight.

7
The categories of this paper are: hep-th
9
The categories of this paper are: nlin
19
The categories of this paper are: eess
5
The categories of this paper are: gr-qc
32
The categories of this paper are: atom-ph
11
The categories of this paper are: hep-lat
35
The categories of this paper are: mtrl-th
34
The categories of this paper are: chem-ph
23
The categories of this paper are: solv-int
13
The categories of this paper are: quant-ph
22
The categories of this paper are: chao-dyn
12
The categories of this paper are: nucl-th
6
The categories of this paper are: astro-ph
20
The categories of this paper are: acc-phys
14
The categories of this paper are: math-ph
25
The categories of this paper are: patt-sol