106
click to vote
STOC
2003
ACM
16 years 3 months ago
2003
ACM
In this paper, we present the first average-case analysis proving an expected polynomial running time for an exact algorithm for the 0/1 knapsack problem. In particular, we prove,...