Approximation of the Quadratic Knapsack Problem
Abstract
For any given ε>0 we provide an algorithm for the Quadratic Knapsack Problem that has an approximation ratio within O(n2/5+ε) and a run time within O(n9/ε).
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.