A quadratic time 2-approximation algorithm for block sorting.
Wolfgang W. BeinLawrence L. LarmoreLinda MoralesIvan Hal SudboroughPublished in: Theor. Comput. Sci. (2009)
Keyphrases
- computational complexity
- objective function
- detection algorithm
- computational cost
- experimental evaluation
- optimal solution
- preprocessing
- improved algorithm
- learning algorithm
- recognition algorithm
- error bounds
- optimization algorithm
- linear programming
- linear computational complexity
- matching algorithm
- particle swarm optimization
- np hard
- k means
- search space
- theoretical analysis
- clustering method
- tree structure
- worst case
- sorting algorithms
- decision trees