A randomised approximation algorithm for the hitting set problem.
Mourad El OualiHelena FohlinAnand SrivastavPublished in: Theor. Comput. Sci. (2014)
Keyphrases
- theoretical analysis
- computational cost
- convex hull
- dynamic programming
- learning algorithm
- times faster
- computational complexity
- objective function
- experimental evaluation
- decomposition algorithm
- tree structure
- worst case
- segmentation algorithm
- convergence rate
- recognition algorithm
- matching algorithm
- detection algorithm
- optimization algorithm
- simulated annealing
- np hard
- data structure
- optimal solution
- input data
- linear programming
- neural network
- probability distribution
- feature space
- search algorithm
- solution space
- decision trees
- error tolerance