Approximation of the Quadratic Knapsack Problem
Data Structures and Algorithms
2016-05-24 v2 Computational Complexity
Discrete Mathematics
Combinatorics
Abstract
For any given we provide an algorithm for the Quadratic Knapsack Problem that has an approximation ratio within and a run time within .
Keywords
Cite
@article{arxiv.1509.01866,
title = {Approximation of the Quadratic Knapsack Problem},
author = {Richard Taylor},
journal= {arXiv preprint arXiv:1509.01866},
year = {2016}
}
Comments
8 pages one figure