Back to Search
Start Over
A $(1.4 + \epsilon)$-approximation algorithm for the $2$-Max-Duo problem
- Publication Year :
- 2017
-
Abstract
- 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$.<br />Comment: 14 pages, 10 figures; an extended abstract appears in Proceedings of the 28th International Symposium on Algorithms and Computation (ISAAC 2017). LIPICS 92, Article No. 66, pp. 66:1--66:12
- Subjects :
- Computer Science - Data Structures and Algorithms
F.2.2
G.2.1
G.4
Subjects
Details
- Database :
- arXiv
- Publication Type :
- Report
- Accession number :
- edsarx.1702.06256
- Document Type :
- Working Paper