A simpler and faster 1.5-approximation algorithm for sorting by transpositions.
Tzvika HartmanRon ShamirPublished in: Inf. Comput. (2006)
Keyphrases
- experimental evaluation
- significant improvement
- objective function
- theoretical analysis
- dynamic programming
- computational cost
- preprocessing
- computationally efficient
- detection algorithm
- high accuracy
- cost function
- closed form
- times faster
- convergence rate
- optimal solution
- input data
- face recognition
- segmentation algorithm
- improved algorithm
- linear programming
- simulated annealing
- worst case
- np hard
- search space
- computational complexity
- learning algorithm
- k means
- matching algorithm
- path planning
- evolutionary algorithm
- convex hull
- error bounds
- approximation schemes
- error tolerance