4 citations · 4 across the 1 of their papers we have counts for
1 paper
Qizheng He, Zhean Xu
In this paper, we obtain a number of new simple pseudo-polynomial time algorithms on the well-known knapsack problem, focusing on the running time dependency on the number of items…