scientific article; zbMATH DE number 1134660

MaRDI QIDQ4382124zbMATH OpenFDO

Authors Rainer E. Burkard, Guochuan Zhang

Publication date 26 March 1998

zbMATH Keywords

approximation algorithmbin packingon-line

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40)

Recommendations

• A \(17/10\)-approximation algorithm for \(k\)-bounded space on-line variable-sized bin packing
• Two-bounded-space bin packing revisited
• Improved Space for Bounded-Space, On-Line Bin-Packing
• scientific article; zbMATH DE number 1670831

Cited in

(20)

• Bounded-space online bin cover
• Online variable-sized bin packing
• Repacking helps in bounded space on-line bin-packing
• Approximation algorithms for partitioning small items in unequal bins to minimize the total size
• A \(17/10\)-approximation algorithm for \(k\)-bounded space on-line variable-sized bin packing
• NF-based algorithms for online bin packing with buffer and bounded item size
• Online bin packing with resource augmentation
• An optimal online algorithm for bounded space variable-sized bin packing
• scientific article; zbMATH DE number 1670831 (Why is no real title available?)
• Two-bounded-space bin packing revisited
• scientific article; zbMATH DE number 5761817 (Why is no real title available?)
• Improved Space for Bounded-Space, On-Line Bin-Packing
• scientific article; zbMATH DE number 1092168 (Why is no real title available?)
• scientific article; zbMATH DE number 2016849 (Why is no real title available?)
• Using Markov chains to design algorithms for bounded-space on-line bin cover
• Approximation and Online Algorithms
• An on-line algorithm for variable-sized bin packing
• Bounded space on-line bin packing: Best is better than first
• A bounded space algorithm for online circle packing
• Resource augmented semi-online bounded space bin packing

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 Q4382124)