scientific article; zbMATH DE number 1092168

MaRDI QIDQ4367453zbMATH OpenFDO

Authors Guochuan Zhang

Publication date 20 September 1998

zbMATH Keywords

\(K\)-bounded spacebin packing problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10)

Recommendations

• A \(17/10\)-approximation algorithm for \(k\)-bounded space on-line variable-sized bin packing
• Bounded space on-line bin packing: Best is better than first
• scientific article; zbMATH DE number 1134660
• Improved Space for Bounded-Space, On-Line Bin-Packing

Cited in

(2)

• Tight performance bound of \(AFBk\) bin packing
• Tight bounds for NF-based bounded-space online bin packing algorithms

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4367453)