A note on 0.5-bounded greedy algorithms for the 0/1 knapsack problem
From MaRDI portal
Publication:1208445
DOI10.1016/0020-0190(92)90089-EzbMath0793.90040MaRDI QIDQ1208445
Publication date: 16 May 1993
Published in: Information Processing Letters (Search for Journal in Brave)
approximation algorithm; greedy algorithms; worst-case bound; subset-sum problem; 0/1 knapsack problem
90C60: Abstract computational complexity for mathematical programming problems
90C09: Boolean programming
Related Items
A Fast Approximation Algorithm For The Subset-Sum Problem, An approximate binary search algorithm for the multiple-choice knapsack problem
Cites Work