Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Load Balancing: The Long Road from Theory to Practice   There is a long history of approximation schemes for the problem of
scheduling jobs on identical machines to minimize the makespan. Such a scheme
grants a $(1+\epsilon)$-approximation solution for every $\epsilon > 0$, but
the running time grows exponentially in $1/\epsilon$. For a long time, these
schemes seemed like a purely theoretical concept. Even solving instances for
moderate values of $\epsilon$ seemed completely illusional. In an effort to
bridge theory and practice, we refine recent ILP techniques to develop the
fastest known approximation scheme for this problem. An implementation of this
algorithm reaches values of $\epsilon$ lower than $2/11\approx 18.2\%$ within a
reasonable timespan. This is the approximation guarantee of MULTIFIT, which, to
the best of our knowledge, has the best proven guarantee of any non-scheme
algorithm.

31
The categories of this paper are: ao-sci
16
The categories of this paper are: stat
9
The categories of this paper are: nlin
10
The categories of this paper are: q-bio
34
The categories of this paper are: chem-ph
20
The categories of this paper are: acc-phys
6
The categories of this paper are: astro-ph
27
The categories of this paper are: comp-gas
30
The categories of this paper are: q-alg
12
The categories of this paper are: nucl-th
7
The categories of this paper are: hep-th
8
The categories of this paper are: hep-ex
21
The categories of this paper are: adap-org
32
The categories of this paper are: atom-ph
2
The categories of this paper are: math
13
The categories of this paper are: quant-ph