scientific article; zbMATH DE number 1134660

zbMATH Open0886.05044MaRDI QIDQ4382124FDOQ4382124

Authors: Rainer E. Burkard, Guochuan Zhang 

Publication date: 26 March 1998

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

approximation algorithmbin packingon-line

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40)

Cited In (18)

• Title not available (Why is that?)
• Improved Space for Bounded-Space, On-Line Bin-Packing
• Repacking helps in bounded space on-line bin-packing
• NF-based algorithms for online bin packing with buffer and bounded item size
• An on-line algorithm for variable-sized bin packing
• Two-bounded-space bin packing revisited
• Title not available (Why is that?)
• A \(17/10\)-approximation algorithm for \(k\)-bounded space on-line variable-sized bin packing
• Online variable-sized bin packing
• Using Markov chains to design algorithms for bounded-space on-line bin cover
• Bounded-space online bin cover
• An optimal online algorithm for bounded space variable-sized bin packing
• Resource augmented semi-online bounded space bin packing
• Approximation and Online Algorithms
• Bounded space on-line bin packing: Best is better than first
• Online bin packing with resource augmentation
• A bounded space algorithm for online circle packing
• Title not available (Why is that?)

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)