On the 1.375-Approximation Algorithm for Sorting by Transpositions in O(n logn) Time.
Luís Felipe I. CunhaLuis Antonio Brasil KowadaRodrigo de A. HausenCelina M. H. de FigueiredoPublished in: BSB (2013)
Keyphrases
- learning algorithm
- closed form
- dynamic programming
- path planning
- detection algorithm
- worst case
- cost function
- significant improvement
- search space
- optimal solution
- approximation ratio
- improved algorithm
- high accuracy
- k means
- matching algorithm
- times faster
- data structure
- error bounds
- theoretical analysis
- computationally efficient
- computational complexity
- convergence rate
- experimental evaluation
- preprocessing
- error tolerance
- neural network
- tree structure
- optimization algorithm
- computational cost
- hidden markov models
- lower bound
- genetic algorithm