On the Fully Polynomial Approximation Algorithm for the 0-1 Knapsack Problem

A modified fast approximation algorithm for 0-1 knapsack problem with improved complexity is presented, based on the schemes of Ibarra, Kim and Babat. By using a new partition of items, the algorithm solves the n-item 0-1 knapsack problem to any relative error tolerance ffl? 0 in the scaled profit space