Login / Signup

New Lower Bounds for Certain Classes of Bin Packing Algorithms.

János BaloghJózsef BékésiGábor Galambos
Published in: WAOA (2010)
Keyphrases
  • bin packing
  • lower bound
  • computational complexity
  • graph colouring
  • data structure
  • np hard
  • worst case
  • search tree
  • data model
  • upper bound
  • optimization problems
  • error bounds