Login / Signup

Partially Dynamic bin Packing can be Solved Within 1 + \varepsilon in (Amortized) Polylogarithmic Time.

Zoran IvkovicErrol L. Lloyd
Published in: Inf. Process. Lett. (1997)
Keyphrases
  • bin packing
  • search tree
  • graph colouring
  • assembly line balancing
  • cutting stock
  • databases
  • data structure
  • np complete