An Efficient Algorithm for Finding an Irredundant Set Cover.
Ramachendra P. BatniJeffrey D. RussellCharles R. KimePublished in: J. ACM (1974)
Keyphrases
- set cover
- np hard
- computational complexity
- dynamic programming
- objective function
- optimization algorithm
- search space
- evolutionary algorithm
- k means
- optimal solution
- worst case
- simulated annealing
- decision trees
- mathematical model
- solution space
- feature selection
- cost function
- neural network
- approximation algorithms
- optimization model
- greedy heuristic