A 6/5-approximation algorithm for the maximum 3-cover problem.
Ioannis CaragiannisGianpiero MonacoPublished in: J. Comb. Optim. (2013)
Keyphrases
- experimental evaluation
- learning algorithm
- computationally efficient
- detection algorithm
- np hard
- computational complexity
- optimal solution
- polynomial time approximation
- worst case
- high accuracy
- times faster
- closed form
- matching algorithm
- recognition algorithm
- improved algorithm
- theoretical analysis
- approximation algorithms
- expectation maximization
- particle swarm optimization
- input data
- linear programming
- approximation ratio
- k means
- approximation methods
- absolute error
- error bounds
- monte carlo
- clustering method
- simulated annealing
- computational cost
- dynamic programming
- image segmentation