A 1.375-Approximation Algorithm for Sorting by Transpositions with Faster Running Time.
Alexsandro Oliveira AlexandrinoKlairton Lima BritoAndre Rodrigues OliveiraUlisses DiasZanoni DiasPublished in: BSB (2022)
Keyphrases
- learning algorithm
- experimental evaluation
- detection algorithm
- matching algorithm
- times faster
- computational cost
- dynamic programming
- improved algorithm
- optimal solution
- k means
- recognition algorithm
- computational complexity
- theoretical analysis
- objective function
- memory efficient
- preprocessing
- high accuracy
- linear programming
- segmentation algorithm
- selection algorithm
- error bounds
- closed form
- sorting algorithms
- classification algorithm
- tree structure
- ant colony optimization
- clustering method
- optimization algorithm
- computationally efficient
- simulated annealing
- np hard
- cost function
- decision trees