Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: An Improved Approximation Algorithm for the Matching Augmentation
  Problem   We present a $\frac53$-approximation algorithm for the matching augmentation
problem (MAP): given a multi-graph with edges of cost either zero or one such
that the edges of cost zero form a matching, find a 2-edge connected spanning
subgraph (2-ECSS) of minimum cost.
  A $\frac74$-approximation algorithm for the same problem was presented
recently, see Cheriyan, et al., "The matching augmentation problem: a
$\frac{7}{4}$-approximation algorithm," {\em Math. Program.}, 182(1):315--354,
2020; arXiv:1810.07816.
  Our improvement is based on new algorithmic techniques, and some of these may
lead to advances on related problems.

3
The categories of this paper are: physics
10
The categories of this paper are: q-bio
18
The categories of this paper are: econ
4
The categories of this paper are: cond-mat
5
The categories of this paper are: gr-qc
32
The categories of this paper are: atom-ph
16
The categories of this paper are: stat
33
The categories of this paper are: plasm-ph
9
The categories of this paper are: nlin
36
The categories of this paper are: cmp-lg
25
The categories of this paper are: patt-sol
30
The categories of this paper are: q-alg
20
The categories of this paper are: acc-phys
35
The categories of this paper are: mtrl-th
28
The categories of this paper are: alg-geom
12
The categories of this paper are: nucl-th