A 7/2-Approximation Algorithm for the Maximum Duo-Preservation String Mapping Problem.
Nicolas BoriaGianpiero CabodiPaolo CamuratiMarco PalenaPaolo PasiniStefano QuerPublished in: CPM (2016)
Keyphrases
- experimental evaluation
- np hard
- improved algorithm
- dynamic programming
- computational complexity
- k means
- recognition algorithm
- high accuracy
- learning algorithm
- matching algorithm
- closed form
- detection algorithm
- optimization algorithm
- convex hull
- optimal solution
- objective function
- convergence rate
- segmentation algorithm
- clustering method
- linear programming
- computational cost
- monte carlo
- times faster
- computationally efficient
- preprocessing
- approximation methods
- randomized algorithm