Advertisement

Introduction to NP-Completeness of Knapsack Problems

  • Hans Kellerer
  • Ulrich Pferschy
  • David Pisinger
Chapter

Abstract

The reader may have noticed that for all the considered variants of the knapsack problem, no polynomial time algorithm have been presented which solves the problem to optimality. Indeed all the algorithms described are based on some kind of search and prune methods, which in the worst case may take exponential time. It would be a satisfying result if we somehow could prove it is not possible to find an algorithm which runs in polynomial time, somehow having evidence that the presented methods are “as good as we can do”. However, no proof has been found showing that the considered variants of the knapsack problem cannot be solved to optimality in polynomial time.

Keywords

Polynomial Time Decision Problem Knapsack Problem Polynomial Time Algorithm Polynomial Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Hans Kellerer
    • 1
  • Ulrich Pferschy
    • 1
  • David Pisinger
    • 2
  1. 1.Department of Statistics and Operations ResearchUniversity of GrazGrazAustria
  2. 2.DIKU, Department of Computer ScienceUniversity of CopenhagenCopenhagenDenmark

Personalised recommendations