Approximation of the Quadratic Knapsack Problem

For any given $ϵ>0$ we provide an algorithm for the Quadratic Knapsack Problem that has an approximation ratio within $O(n^{2\mathrm{/}5+ϵ})$ and a run time within $O(n^{9\mathrm{/}ϵ})$.