Login / Signup

A new upper bound for the online square packing problem in a strip.

Guosong YuYanling MaoJiaoliao Xiao
Published in: J. Comb. Optim. (2017)
Keyphrases
  • packing problem
  • upper bound
  • lower bound
  • bin packing
  • worst case
  • online learning
  • arbitrary shaped
  • real time
  • lower and upper bounds
  • image processing
  • feature space
  • image compression
  • np complete
  • error probability