Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Dynamic Matching: Reducing Integral Algorithms to Approximately-Maximal
  Fractional Algorithms   We present a simple randomized reduction from fully-dynamic integral matching
algorithms to fully-dynamic "approximately-maximal" fractional matching
algorithms. Applying this reduction to the recent fractional matching algorithm
of Bhattacharya, Henzinger, and Nanongkai (SODA 2017), we obtain a novel result
for the integral problem. Specifically, our main result is a randomized
fully-dynamic $(2+\epsilon)$-approximate integral matching algorithm with small
polylog worst-case update time. For the $(2+\epsilon)$-approximation regime
only a \emph{fractional} fully-dynamic $(2+\epsilon)$-matching algorithm with
worst-case polylog update time was previously known, due to Bhattacharya et
al.~(SODA 2017). Our algorithm is the first algorithm that maintains
approximate matchings with worst-case update time better than polynomial, for
any constant approximation ratio. As a consequence, we also obtain the first
constant-approximate worst-case polylogarithmic update time maximum weight
matching algorithm.

2
The categories of this paper are: math
21
The categories of this paper are: adap-org
36
The categories of this paper are: cmp-lg
34
The categories of this paper are: chem-ph
29
The categories of this paper are: funct-an
19
The categories of this paper are: eess
9
The categories of this paper are: nlin
8
The categories of this paper are: hep-ex
24
The categories of this paper are: dg-ga
11
The categories of this paper are: hep-lat
6
The categories of this paper are: astro-ph
14
The categories of this paper are: math-ph
35
The categories of this paper are: mtrl-th
33
The categories of this paper are: plasm-ph
27
The categories of this paper are: comp-gas
18
The categories of this paper are: econ