A Faster and Simpler 2-Approximation Algorithm for Block Sorting.
Wolfgang W. BeinLawrence L. LarmoreLinda MoralesIvan Hal SudboroughPublished in: FCT (2005)
Keyphrases
- dynamic programming
- learning algorithm
- theoretical analysis
- search space
- detection algorithm
- neural network
- approximation ratio
- preprocessing
- memory efficient
- optimization algorithm
- times faster
- simulated annealing
- matching algorithm
- ant colony optimization
- segmentation algorithm
- error bounds
- cost function
- significant improvement
- k means
- computational complexity
- recognition algorithm
- improved algorithm
- approximation schemes
- input data
- worst case
- experimental evaluation
- np hard
- lower bound
- optimal solution
- genetic algorithm