Login / Signup
Truly asymptotic lower bounds for online vector bin packing.
János Balogh
Leah Epstein
Asaf Levin
Published in:
CoRR (2020)
Keyphrases
</>
bin packing
lower bound
online algorithms
upper bound
search tree
worst case
assembly line balancing
online learning
graph colouring
branch and bound algorithm
objective function
branch and bound
packing problem
cutting stock
vc dimension
vector space
knn
search algorithm
optimal solution