Truly Asymptotic Lower Bounds for Online Vector Bin Packing.

János Balogh Ilan Reuven Cohen Leah Epstein Asaf Levin

Published in: APPROX-RANDOM (2021)

Keyphrases

bin packing
lower bound
online algorithms
search tree
upper bound
online learning
worst case
branch and bound algorithm
graph colouring
assembly line balancing
packing problem
objective function
branch and bound
multi dimensional
cutting stock
database systems
np hard
data structure