2000 character limit reached
Approximation of the Quadratic Knapsack Problem (1509.01866v2)
Published 6 Sep 2015 in cs.DS, cs.CC, cs.DM, and math.CO
Abstract: For any given $\epsilon>0$ we provide an algorithm for the Quadratic Knapsack Problem that has an approximation ratio within $O(n{2/5+\epsilon})$ and a run time within $O(n{9/\epsilon})$.
Sponsored by Paperpile, the PDF & BibTeX manager trusted by top AI labs.
Get 30 days freePaper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.