The Worst and the Most Probable Performance of a Class of Set-Covering Algorithms.

Vladimir Lifschitz Boris G. Pittel

Published in: SIAM J. Comput. (1983)

Keyphrases

set covering
learning algorithm
computationally efficient
computational complexity
significant improvement
orders of magnitude
data structure
optimization problems
neural network
data mining
lower bound
probability distribution
upper bound
theoretical analysis
benchmark datasets
times faster