Tight performance bound of AFBk bin packing

DOI10.1007/BF02009554MaRDI QIDQ1375348zbMATH OpenFDO

Authors Minyi Yue, Guochuan Zhang

Publication date 11 May 1998

Published in Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02009554

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Cites work

• scientific article; zbMATH DE number 432833 (Why is no real title available?)
• scientific article; zbMATH DE number 1092168 (Why is no real title available?)
• On-line bin packing ? A restricted survey
• Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms

Cited in

(3)

• A \(17/10\)-approximation algorithm for \(k\)-bounded space on-line variable-sized bin packing
• Tighter bounds for the harmonic bin packing algorithm
• Lower bounds for several standard bin packing algorithms in the random order model

This page was built for publication: Tight performance bound of \(AFBk\) bin packing

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