Login / Signup
An almost optimal approximation algorithm for monotone submodular multiple knapsack.
Yaron Fairstein
Ariel Kulik
Joseph (Seffi) Naor
Danny Raz
Hadas Shachnai
Published in:
J. Comput. Syst. Sci. (2022)
Keyphrases
</>
dynamic programming
optimal solution
search space
cost function
worst case
objective function
np hard
linear programming
approximation algorithms
bin packing
error tolerance
computational complexity
lower bound
special case
upper bound
globally optimal