An approximation algorithm for the problem of sorting by transversals.
Maria Emília Telles WalterAna Luisa FreireClesio MouraDaniela XavierPublished in: WOB (2004)
Keyphrases
- learning algorithm
- approximation ratio
- computational complexity
- dynamic programming
- preprocessing
- experimental evaluation
- np hard
- cost function
- high accuracy
- closed form
- computational cost
- improved algorithm
- approximation algorithms
- k means
- optimal solution
- computationally efficient
- image segmentation
- linear programming
- probabilistic model
- detection algorithm
- worst case
- scheduling problem
- objective function
- similarity measure
- particle swarm optimization
- theoretical analysis
- optimization algorithm
- data sets
- significant improvement
- recognition algorithm
- sorting algorithms