A New Fully Polynomial Time Approximation Scheme for the Knapsack Problem

• 1 January 1999
• journal article
• Published by Springer Nature in Journal of Combinatorial Optimization
• Vol. 3  (1) , 59-71
• https://doi.org/10.1023/a:1009813105532

Abstract

Keywords

• KNAPSACK
• POLYNOMIAL TIME
• FPTAS
• APPROXIMATION SCHEME
• FULLY POLYNOMIAL
• TIME APPROXIMATION
• 1/Ε3
• 1/Ε2