Resource augmentation for online bounded space bin packing

DOI10.1016/S0196-6774(02)00202-XzbMath1026.68154OpenAlexW2099519545WikidataQ101127034 ScholiaQ101127034MaRDI QIDQ4805398

Gerhard J. Woeginger, János A. Csirik

Publication date: 14 May 2003

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0196-6774(02)00202-x

zbMATH Keywords

approximation algorithmcompetitive analysisonline algorithmbin packingresource augmentationasymptotic worst case ratio

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Related Items (10)

Bin packing with rejection revisited ⋮ Evaluating the quality of online optimization algorithms by discrete event simulation ⋮ Online knapsack with resource augmentation ⋮ Online bin packing with resource augmentation ⋮ The online knapsack problem: advice and randomization ⋮ Interior-Point-Based Online Stochastic Bin Packing ⋮ Resource augmented semi-online bounded space bin packing ⋮ Tight results for next fit and worst fit with resource augmentation ⋮ More on batched bin packing ⋮ On dynamic bin packing: An improved lower bound and resource augmentation analysis

This page was built for publication: Resource augmentation for online bounded space bin packing