Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Quasi-PTAS for Scheduling with Precedences using LP Hierarchies   A central problem in scheduling is to schedule $n$ unit size jobs with
precedence constraints on $m$ identical machines so as to minimize the
makespan. For $m=3$, it is not even known if the problem is NP-hard and this is
one of the last open problems from the book of Garey and Johnson.
  We show that for fixed $m$ and $\epsilon$, $(\log n)^{O(1)}$ rounds of
Sherali-Adams hierarchy applied to a natural LP of the problem provides a
$(1+\epsilon)$-approximation algorithm running in quasi-polynomial time. This
improves over the recent result of Levey and Rothvoss, who used $r=(\log
n)^{O(\log \log n)}$ rounds of Sherali-Adams in order to get a
$(1+\epsilon)$-approximation algorithm with a running time of $n^{O(r)}$.

11
The categories of this paper are: hep-lat
6
The categories of this paper are: astro-ph
36
The categories of this paper are: cmp-lg
8
The categories of this paper are: hep-ex
34
The categories of this paper are: chem-ph
26
The categories of this paper are: bayes-an
35
The categories of this paper are: mtrl-th
9
The categories of this paper are: nlin
18
The categories of this paper are: econ
20
The categories of this paper are: acc-phys
28
The categories of this paper are: alg-geom
23
The categories of this paper are: solv-int
17
The categories of this paper are: q-fin
19
The categories of this paper are: eess
33
The categories of this paper are: plasm-ph
4
The categories of this paper are: cond-mat