Login / Signup

Tight bounds for NF-based bounded-space online bin packing algorithms.

József BékésiGábor Galambos
Published in: J. Comb. Optim. (2018)
Keyphrases
  • bin packing
  • tight bounds
  • graph colouring
  • data structure
  • search space
  • learning algorithm
  • computational complexity
  • assembly line balancing
  • packing problem