Tight Worst-Case Performance Bounds for Next-k-Fit Bin Packing
From MaRDI portal
Publication:4037682
DOI10.1137/0222004zbMath0767.68059OpenAlexW1981964469MaRDI QIDQ4037682
Publication date: 16 May 1993
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0222004
Related Items (5)
Worst-case analysis of fast heuristics for packing squares into a square ⋮ On-line bin packing ? A restricted survey ⋮ A 4-space bounded approximation algorithm for online bin packing problem ⋮ Best \(k\)-fit bin packing ⋮ A \(17/10\)-approximation algorithm for \(k\)-bounded space on-line variable-sized bin packing
This page was built for publication: Tight Worst-Case Performance Bounds for Next-k-Fit Bin Packing