The optimal absolute ratio for online bin packing

DOI10.1137/1.9781611973730.94MaRDI QIDQ5363009zbMATH OpenOpenAlexFDO

Authors János Balogh, József Békési, György Dósa, Jiří Sgall, Rob van Stee

Publication date 5 October 2017

Published in Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1.9781611973730.94

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Combinatorial optimization (90C27)

Cited in

(17)

• Colored bin packing: online algorithms and lower bounds
• The optimal absolute ratio for online bin packing
• More on batched bin packing
• Online packing of arbitrary sized items into designated and multipurpose bins
• Batch scheduling of nonidentical job sizes with minsum criteria
• Fully dynamic bin packing revisited
• Approximation and online algorithms for multidimensional bin packing: a survey
• Bounds for online bin packing with cardinality constraints
• Online two-dimensional vector packing with advice
• Bin packing and cutting stock problems: mathematical models and exact algorithms
• scientific article; zbMATH DE number 6842581 (Why is no real title available?)
• A new and improved algorithm for online bin packing
• Constant-ratio approximation for robust bin packing with budgeted uncertainty
• Interior-point-based online stochastic bin packing
• A 4-space bounded approximation algorithm for online bin packing problem
• On online approximation algorithms for two-stage bins
• An asymptotic competitive scheme for online bin packing

This page was built for publication: The optimal absolute ratio for online bin packing

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