Tight performance bound of AFBk bin packing

DOI10.1007/BF02009554zbMATH Open0900.68223MaRDI QIDQ1375348FDOQ1375348

Authors: Minyi Yue, Guochuan Zhang 

Publication date: 11 May 1998

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

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Cites Work

• Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
• On-line bin packing ? A restricted survey
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (2)

• Tighter bounds for the harmonic bin packing algorithm
• A \(17/10\)-approximation algorithm for \(k\)-bounded space on-line variable-sized bin packing

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)