An improved approximation algorithm for the partial Latin square extension problem.
Carla P. GomesRommel G. RegisDavid B. ShmoysPublished in: Oper. Res. Lett. (2004)
Keyphrases
- learning algorithm
- k means
- similarity measure
- significant improvement
- approximation ratio
- improved algorithm
- error bounds
- times faster
- optimization algorithm
- segmentation algorithm
- computational cost
- search algorithm
- experimental evaluation
- objective function
- convex hull
- closed form
- computationally efficient
- probabilistic model
- cost function
- np hard
- linear programming
- search space
- computational complexity
- detection algorithm
- ant colony optimization
- tree structure
- classification algorithm
- high accuracy
- data structure
- selection algorithm
- optimal solution