A 2.25-Approximation Algorithm for Cut-and-Paste Sorting of Unsigned Circular Permutations.
Xiaowen LouDaming ZhuPublished in: COCOON (2008)
Keyphrases
- dynamic programming
- learning algorithm
- preprocessing
- improved algorithm
- np hard
- objective function
- times faster
- tree structure
- simulated annealing
- high accuracy
- search space
- computational complexity
- experimental evaluation
- computationally efficient
- cost function
- matching algorithm
- closed form
- worst case
- probabilistic model
- linear programming
- theoretical analysis
- hough transform
- monte carlo
- recognition algorithm
- piecewise constant