• Vijay V. Vazirani


In Chapter 1 we mentioned that some NP-hard optimization problems allow approximability to any required degree. In this chapter, we will formalize this notion and will show that the knapsack problem admits such an approximability.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 141.
    O.H. Ibarra and C.E. Kim. Fast approximation algorithms for the knapsack and sum of subset problems. Journal of the ACM, 22: 463–468, 1975.MathSciNetCrossRefGoogle Scholar
  2. 98.
    M.R. Garey and D.S. Johnson. Strong NP-completeness results: motivation, examples, and implications. Journal of the ACM, 25: 499–508, 1978.MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Vijay V. Vazirani
    • 1
  1. 1.Georgia Institute of TechnologyCollege of ComputingAtlantaUSA

Personalised recommendations