Approximation of the Quadratic Knapsack Problem

preprint2016arXivOpen access

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

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Write a reviewWrite

No reviews yet.

Add a commentWrite

No comments yet.

Approximation of the Quadratic Knapsack Problem

Abstract

Connections

Building this map preview

Reviews 0

Discussion 0