Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Weighted Completion Time Minimization for Unrelated Machines via
  Iterative Fair Contention Resolution   We give a 1.488-approximation for the classic scheduling problem of
minimizing total weighted completion time on unrelated machines. This is a
considerable improvement on the recent breakthrough of $(1.5 -
10^{-7})$-approximation (STOC 2016, Bansal-Srinivasan-Svensson) and the
follow-up result of $(1.5 - 1/6000)$-approximation (FOCS 2017, Li). Bansal et
al. introduced a novel rounding scheme yielding strong negative correlations
for the first time and applied it to the scheduling problem to obtain their
breakthrough, which resolved the open problem if one can beat out the
long-standing $1.5$-approximation barrier based on independent rounding. Our
key technical contribution is in achieving significantly stronger negative
correlations via iterative fair contention resolution, which is of independent
interest. Previously, Bansal et al. obtained strong negative correlations via a
variant of pipage type rounding and Li used it as a black box.

33
The categories of this paper are: plasm-ph
11
The categories of this paper are: hep-lat
3
The categories of this paper are: physics
31
The categories of this paper are: ao-sci
6
The categories of this paper are: astro-ph
16
The categories of this paper are: stat
24
The categories of this paper are: dg-ga
28
The categories of this paper are: alg-geom
15
The categories of this paper are: nucl-ex
25
The categories of this paper are: patt-sol
0
The categories of this paper are: hep-ph
36
The categories of this paper are: cmp-lg
7
The categories of this paper are: hep-th
14
The categories of this paper are: math-ph
4
The categories of this paper are: cond-mat
22
The categories of this paper are: chao-dyn