A family of approximation algorithms for the maximum duo-preservation string mapping problem.
Bartlomiej DudekPawel GawrychowskiPiotr Ostropolski-NalewajaPublished in: CoRR (2017)
Keyphrases
- approximation algorithms
- special case
- np hard
- worst case
- vertex cover
- closest string
- minimum cost
- network design problem
- set cover
- facility location problem
- primal dual
- longest common subsequence
- approximation schemes
- np hardness
- exact algorithms
- constant factor
- approximation ratio
- integrality gap
- open shop
- constant factor approximation
- regular expressions
- edit distance
- search space
- computational complexity