Random knapsack in expected polynomial time.

René Beier Berthold Vöcking

Published in: J. Comput. Syst. Sci. (2004)

Keyphrases

knapsack problem
approximation algorithms
special case
dynamic programming
optimal solution
computational complexity
upper bound
worst case
database
databases
knowledge base
multiscale
data sets
learning algorithm
feasible solution
np hardness