Papers
Topics
Authors
Recent
Search
2000 character limit reached

Approximation of the Quadratic Knapsack Problem

Published 6 Sep 2015 in cs.DS, cs.CC, cs.DM, and math.CO | (1509.01866v2)

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})$.

Authors (1)
Citations (16)
View on Semantic Scholar

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Collections

Sign up for free to add this paper to one or more collections.

Sign Up