Fine Grained Lower Bounds for Multidimensional Knapsack.

Ilan Doron-Arad Ariel Kulik Pasin Manurangsi

Published in: CoRR (2024)

Keyphrases

fine grained
lower bound
upper bound
optimal solution
coarse grained
knapsack problem
np hard
objective function
access control
dynamic programming
worst case
multi dimensional
massively parallel
vc dimension
data lineage
tightly coupled
high level
packing problem
co occurrence
search engine