Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Simplified and Space-Optimal Semi-Streaming for
  $(2+\epsilon)$-Approximate Matching   In a recent breakthrough, Paz and Schwartzman (SODA'17) presented a
single-pass ($2+\epsilon$)-approximation algorithm for the maximum weight
matching problem in the semi-streaming model. Their algorithm uses $O(n\log^2
n)$ bits of space, for any constant $\epsilon>0$.
  We present two simplified and more intuitive analyses, for essentially the
same algorithm, which also improve the space complexity to the optimal bound of
$O(n\log n)$ bits --- this is optimal as the output matching requires
$\Omega(n\log n)$ bits. Our analyses rely on a simple use of the primal-dual
method and a simple accounting method.

12
The categories of this paper are: nucl-th
5
The categories of this paper are: gr-qc
37
The categories of this paper are: supr-con
11
The categories of this paper are: hep-lat
3
The categories of this paper are: physics
14
The categories of this paper are: math-ph
26
The categories of this paper are: bayes-an
28
The categories of this paper are: alg-geom
21
The categories of this paper are: adap-org
10
The categories of this paper are: q-bio
0
The categories of this paper are: hep-ph
36
The categories of this paper are: cmp-lg
23
The categories of this paper are: solv-int
18
The categories of this paper are: econ
8
The categories of this paper are: hep-ex
25
The categories of this paper are: patt-sol