An O(mn) Algorithm for Regular Set-Covering Problems.
Paola BertolazziAntonio SassanoPublished in: Theor. Comput. Sci. (1987)
Keyphrases
- set covering problem
- optimization algorithm
- k means
- computational efficiency
- computational complexity
- learning algorithm
- significant improvement
- dynamic programming
- segmentation algorithm
- experimental evaluation
- search space
- preprocessing
- detection algorithm
- np hard
- simulated annealing
- association rules
- optimal solution
- recognition algorithm
- integer programming
- objective function