Further improvement in approximating the maximum duo-preservation string mapping problem

DOI10.1007/978-3-319-43681-4_5zbMath1382.68346OpenAlexW2506649003MaRDI QIDQ1708415

Brian Brubach

Publication date: 23 March 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-43681-4_5

zbMATH Keywords

string algorithmspolynomial-time approximationmax duo-preservation string mapping problemmin common string partition problem

Mathematics Subject Classification ID

Approximation algorithms (68W25) Algorithms on strings (68W32)

Related Items (4)

Revisiting the parameterized complexity of maximum-duo preservation string mapping ⋮ A \((1.4+\epsilon)\)-approximation algorithm for the 2-\textsc{Max-Duo} problem ⋮ Unnamed Item ⋮ A (1.4 + epsilon)-Approximation Algorithm for the 2-Max-Duo Problem

This page was built for publication: Further improvement in approximating the maximum duo-preservation string mapping problem