Journal
OPERATIONS RESEARCH LETTERS
Volume 44, Issue 4, Pages 495-497Publisher
ELSEVIER SCIENCE BV
DOI: 10.1016/j.orl.2016.05.005
Keywords
Quadratic knapsack; Approximation algorithm
Categories
Ask authors/readers for more resources
For any given epsilon > 0 we provide an algorithm for the Quadratic Knapsack Problem that has an approximation ratio within 0(n(2/5+epsilon)) and a run time within 0(n(9/epsilon)). Crown Copyright (C) 2016 Published by Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available
Share Paper
