Polynomial-time algorithms for regular set-covering and threshold synthesis.

Uri N. Peled Bruno Simeone

Published in: Discret. Appl. Math. (1985)

Keyphrases

set covering
orders of magnitude
data structure
worst case
learning algorithm
theoretical analysis
computational complexity
significant improvement
computational cost
computationally efficient
data sets
decision trees
special case
optimization problems
data mining techniques
approximation algorithms