Abstract
A fully polynomial ϵ-approximation algorithm is developed for the 0–1 knapsack problem. The algorithm uses results of Lawler and Ibarra and Kim. A pseudo-polynomial dynamic programming algorithm is first suggested which solves the problem in O( nb log n) time and O( b) space.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have