Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Restricted Max-Min Fair Allocation   The restricted max-min fair allocation problem seeks an allocation of
resources to players that maximizes the minimum total value obtained by any
player. It is NP-hard to approximate the problem to a ratio less than 2.
Comparing the current best algorithm for estimating the optimal value with the
current best for constructing an allocation, there is quite a gap between the
ratios that can be achieved in polynomial time: roughly 4 for estimation and
roughly $6 + 2\sqrt{10}$ for construction. We propose an algorithm that
constructs an allocation with value within a factor of $6 + \delta$ from the
optimum for any constant $\delta > 0$. The running time is polynomial in the
input size for any constant $\delta$ chosen.

19
The categories of this paper are: eess
5
The categories of this paper are: gr-qc
29
The categories of this paper are: funct-an
34
The categories of this paper are: chem-ph
10
The categories of this paper are: q-bio
24
The categories of this paper are: dg-ga
0
The categories of this paper are: hep-ph
20
The categories of this paper are: acc-phys
17
The categories of this paper are: q-fin
15
The categories of this paper are: nucl-ex
27
The categories of this paper are: comp-gas
11
The categories of this paper are: hep-lat
36
The categories of this paper are: cmp-lg
31
The categories of this paper are: ao-sci
14
The categories of this paper are: math-ph
28
The categories of this paper are: alg-geom