Bounded space on-line bin packing: Best is better than first

DOI10.1007/s00453-001-0041-7zbMath0980.68141OpenAlexW3137260489MaRDI QIDQ5946401

David S. Johnson, János A. Csirik

Publication date: 4 March 2002

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-001-0041-7

zbMATH Keywords

\(K\)-bounded best fit algorithmson-line bin packing algorithms

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Related Items

Online Colored Bin Packing ⋮ Improved approximation algorithms for maximum resource bin packing and lazy bin covering problems ⋮ Improved Online Algorithms for 2-Space Bounded 2-Dimensional Bin Packing ⋮ Online algorithms for 1-space bounded multidimensional bin packing and hypercube packing ⋮ Homogeneous grouping of non-prime steel products for online auctions: a case study ⋮ A 4-space bounded approximation algorithm for online bin packing problem ⋮ Colored bin packing: online algorithms and lower bounds ⋮ Efficient 1-space bounded hypercube packing algorithm ⋮ On-line algorithms for 2-space bounded 2-dimensional bin packing ⋮ Online Algorithm for 1-Space Bounded Multi-dimensional Bin Packing ⋮ Average case analysis of bounded space bin packing algorithms ⋮ ONE-SPACE BOUNDED ALGORITHMS FOR TWO-DIMENSIONAL BIN PACKING ⋮ Online algorithms for 1-space bounded 2-dimensional bin packing and square packing ⋮ On lazy bin covering and packing problems ⋮ A note on one-space bounded square packing ⋮ Locality-preserving allocations problems and coloured bin packing