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

DOI10.1007/BF02677351zbMath0932.90033MaRDI QIDQ1299865

Guo-Chuan Zhang

Publication date: 11 November 1999

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

zbMATH Keywords

on-line algorithmbin packing problemworst-case analysis

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Unnamed Item
• An on-line algorithm for variable-sized bin packing
• Best \(k\)-fit bin packing
• Online variable-sized bin packing
• Tight performance bound of \(AFBk\) bin packing
• Worst-case analysis of the FFH algorithm for online variable-sized bin packing
• Variable Sized Bin Packing
• Tight Worst-Case Performance Bounds for Next-k-Fit Bin Packing
• Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms

This page was built for publication: A \(17/10\)-approximation algorithm for \(k\)-bounded space on-line variable-sized bin packing