Login / Signup

The Tight Bound of First Fit Decreasing Bin-Packing Algorithm Is FFD(I) <= 11/9OPT(I) + 6/9.

György Dósa
Published in: ESCAPE (2007)
Keyphrases
  • bin packing
  • worst case
  • optimal solution
  • cost function
  • upper bound
  • objective function
  • lower bound
  • dynamic programming
  • learning algorithm
  • similarity measure
  • search space
  • scheduling problem
  • r tree
  • graph colouring