Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Approximation Algorithms for Combinatorial Optimization

APPROX 1998: Approximation Algorithms for Combinatiorial Optimization pp 123–134Cite as

A new fully polynomial approximation scheme for the knapsack problem

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1444))

Abstract

A fully polynomial 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·l/ɛ) space, respectively. Our new approximation scheme requires only O(n + 1/ɛ2) space while also reducing the running time.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Caprara, H. Kellerer, U. Pferschy, D. Pisinger, “Approximation algorithms for knapsack problems with cardinality constraints”, Technical Report 01/1998, Faculty of Economics, University Graz, submitted.

    Google Scholar 

  2. H. Kellerer, R. Mansini, U. Pferschy, M.G. Speranza, “An efficient fully polynomial approximation scheme for the subset-sum problem”, Technical Report 14/1997, Fac. of Economics, Univ. Graz, submitted, see also Proceedings of the 8th ISAAC Symposium, Springer Lecture Notes in Computer Science 1350, 394–403, 1997.

    Google Scholar 

  3. E. Lawler, “Fast approximation algorithms for knapsack problems”, Mathematics of Operations Research 4, 339–356, 1979.

    Article  MATH  MathSciNet  Google Scholar 

  4. M.J. Magazine, O. Oguz, “A fully polynomial approximation algorithm for the 0-1 knapsack problem”, European Journal of Operational Research, 8, 270–273, 1981.

    Article  MATH  MathSciNet  Google Scholar 

  5. S. Martello, P. Toth, Knapsack Problems, J. Wiley & Sons, 1990.

    Google Scholar 

  6. D. Pisinger, P. Toth, “Knapsack Problems”, in D.Z. Du, P. Pardalos (eds.) Handbook of Combinatorial Optimization, Kluwer, Norwell, 1–89, 1997.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Statistics and Operations Research, University Graz, UniversitÄtsstr. 15, A-8010, Graz, Austria

    Hans Kellerer & Ulrich Pferschy

Authors
  1. Hans Kellerer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ulrich Pferschy
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Klaus Jansen José Rolim

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kellerer, H., Pferschy, U. (1998). A new fully polynomial approximation scheme for the knapsack problem. In: Jansen, K., Rolim, J. (eds) Approximation Algorithms for Combinatiorial Optimization. APPROX 1998. Lecture Notes in Computer Science, vol 1444. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0053969

Download citation

  • DOI: https://doi.org/10.1007/BFb0053969

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64736-2

  • Online ISBN: 978-3-540-69067-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation