A Family of Approximation Algorithms for the Maximum Duo-Preservation String Mapping Problem.
Bartlomiej DudekPawel GawrychowskiPiotr Ostropolski-NalewajaPublished in: CPM (2017)
Keyphrases
- approximation algorithms
- special case
- np hard
- worst case
- closest string
- vertex cover
- np hardness
- minimum cost
- constant factor
- facility location problem
- network design problem
- randomized algorithms
- primal dual
- approximation ratio
- longest common subsequence
- approximation schemes
- set cover
- regular expressions
- open shop
- integrality gap
- exact algorithms
- edit distance
- precedence constraints
- disjoint paths
- undirected graph
- linear programming
- lower bound
- optimal solution