Abstract
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.
Cite
CITATION STYLE
APA
Vazirani, V. V. (2003). Knapsack. In Approximation Algorithms (pp. 68–73). Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-662-04565-7_8
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free