Best \(k\)-fit bin packing

DOI10.1007/BF02243816zbMath0776.68059MaRDI QIDQ685862

Juan-Miguel Gracia

Publication date: 18 October 1993

Published in: Computing (Search for Journal in Brave)

zbMATH Keywords

approximation algorithmbin packingworst-case performance boundBest- \(k\)-Fit

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05)

Related Items

On-line bin packing ? A restricted survey ⋮ Average case analysis of bounded space bin packing algorithms ⋮ A \(17/10\)-approximation algorithm for \(k\)-bounded space on-line variable-sized bin packing

Cites Work

• Unnamed Item
• Unnamed Item
• Fast algorithms for bin packing
• Tight Worst-Case Performance Bounds for Next-k-Fit Bin Packing

This page was built for publication: Best \(k\)-fit bin packing