An improved approximation algorithm for the partial latin square extension problem.
Carla P. GomesRommel G. RegisDavid B. ShmoysPublished in: SODA (2003)
Keyphrases
- learning algorithm
- times faster
- classification algorithm
- approximation ratio
- computational complexity
- objective function
- dynamic programming
- cost function
- significant improvement
- convergence rate
- experimental evaluation
- detection algorithm
- matching algorithm
- worst case
- computationally efficient
- segmentation algorithm
- optimization algorithm
- preprocessing
- optimal solution
- convex hull
- path planning
- search space
- clustering method
- particle swarm optimization
- k means
- np hard