Fully Dynamic Bin Packing

DOI10.1007/978-1-4020-9688-4_15MaRDI QIDQ5192367zbMATH OpenOpenAlexFDO

Authors Zoran Ivković, Errol L. Lloyd

Publication date 5 August 2009

Published in Fundamental Problems in Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-1-4020-9688-4_15

zbMATH Keywords

approximation algorithmbin packingfully dynamic

Mathematics Subject Classification ID

Approximation algorithms (68W25)

Recommendations

• Fully Dynamic Algorithms for Bin Packing: Being (Mostly) Myopic Helps
• A fundamental restriction on fully dynamic maintenance of bin packing
• Fully dynamic bin packing revisited
• scientific article; zbMATH DE number 6767525
• Partially dynamic bin packing can be solved within \(1 + \varepsilon\) in (amortized) polylogarithmic time

Cited in

(10)

• A robust APTAS for the classical bin packing problem
• Fully dynamic bin packing revisited
• Dynamic bin packing of unit fractions items
• A Robust APTAS for the Classical Bin Packing Problem
• Fully Dynamic Algorithms for Bin Packing: Being (Mostly) Myopic Helps
• An \(\frac{8}{3}\) lower bound for online dynamic bin packing
• Fully-dynamic bin packing with little repacking
• scientific article; zbMATH DE number 6767525 (Why is no real title available?)
• A fundamental restriction on fully dynamic maintenance of bin packing
• Robust scheduling on uniform machines. New results using a relaxed approximation guarantee

This page was built for publication: Fully Dynamic Bin Packing

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