A New Fully Polynomial Time Approximation Scheme for the Knapsack Problem

Hans Kellerer () and Ulrich Pferschy ()
Additional contact information
Hans Kellerer: University of Graz
Ulrich Pferschy: University of Graz

Journal of Combinatorial Optimization, 1999, vol. 3, issue 1, No 5, 59-71

Abstract: Abstract A fully polynomial time approximation scheme (FPTAS) is presented for the classical 0-1 knapsack problem. The new approach considerably improves the necessary space requirements. The two best previously known approaches need O(n + 1/ε3) and O(n · 1/ε) space, respectively. Our new approximation scheme requires only O(n + 1/ε2) space while also reducing the running time.

Keywords: knapsack problem; fully polynomial approximation scheme (search for similar items in EconPapers)
Date: 1999
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (13)

Downloads: (external link)
http://link.springer.com/10.1023/A:1009813105532 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:3:y:1999:i:1:d:10.1023_a:1009813105532

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1023/A:1009813105532

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().