The optimal absolute ratio for online bin packing

DOI10.1137/1.9781611973730.94zbMATH Open1371.68327OpenAlexW4247440730MaRDI QIDQ5363009FDOQ5363009

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 (16)

• Colored bin packing: online algorithms and lower bounds
• Constant-Ratio Approximation for Robust Bin Packing with Budgeted Uncertainty
• The optimal absolute ratio for online bin packing
• More on batched bin packing
• Approximation and online algorithms for multidimensional bin packing: a survey
• Online packing of arbitrary sized items into designated and multipurpose bins
• Bin packing and cutting stock problems: mathematical models and exact algorithms
• An asymptotic competitive scheme for online bin packing
• Batch scheduling of nonidentical job sizes with minsum criteria
• Title not available (Why is that?)
• Fully dynamic bin packing revisited
• Online two-dimensional vector packing with advice
• Bounds for online bin packing with cardinality constraints
• A 4-space bounded approximation algorithm for online bin packing problem
• Interior-Point-Based Online Stochastic Bin Packing
• Title not available (Why is that?)

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)