Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: A $(1.4 + \epsilon)$-approximation algorithm for the $2$-Max-Duo problem   The maximum duo-preservation string mapping (Max-Duo) problem is the
complement of the well studied minimum common string partition (MCSP) problem,
both of which have applications in many fields including text compression and
bioinformatics. $k$-Max-Duo is the restricted version of Max-Duo, where every
letter of the alphabet occurs at most $k$ times in each of the strings, which
is readily reduced into the well known maximum independent set (MIS) problem on
a graph of maximum degree $\Delta \le 6(k-1)$. In particular, $2$-Max-Duo can
then be approximated arbitrarily close to $1.8$ using the state-of-the-art
approximation algorithm for the MIS problem. $2$-Max-Duo was proved APX-hard
and very recently a $(1.6 + \epsilon)$-approximation was claimed, for any
$\epsilon > 0$. In this paper, we present a vertex-degree reduction technique,
based on which, we show that $2$-Max-Duo can be approximated arbitrarily close
to $1.4$.

23
The categories of this paper are: solv-int
26
The categories of this paper are: bayes-an
37
The categories of this paper are: supr-con
18
The categories of this paper are: econ
19
The categories of this paper are: eess
27
The categories of this paper are: comp-gas
9
The categories of this paper are: nlin
6
The categories of this paper are: astro-ph
32
The categories of this paper are: atom-ph
25
The categories of this paper are: patt-sol
5
The categories of this paper are: gr-qc
22
The categories of this paper are: chao-dyn
4
The categories of this paper are: cond-mat
33
The categories of this paper are: plasm-ph
0
The categories of this paper are: hep-ph
10
The categories of this paper are: q-bio