Resource augmentation for online bounded space bin packing

DOI10.1016/S0196-6774(02)00202-XMaRDI QIDQ4805398zbMATH OpenOpenAlexWikidataFDO

Authors Gerhard J. Woeginger, János 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 algorithmasymptotic worst case ratiobin packingcompetitive analysisonline algorithmresource augmentation

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Recommendations

• scientific article; zbMATH DE number 1670832
• On Dynamic Bin Packing: An Improved Lower Bound and Resource Augmentation Analysis
• Resource augmented semi-online bounded space bin packing
• Online bin packing with resource augmentation
• Approximation and Online Algorithms

Cited in

(17)

• On dynamic bin packing: An improved lower bound and resource augmentation analysis
• Repacking helps in bounded space on-line bin-packing
• Evaluating the quality of online optimization algorithms by discrete event simulation
• Online knapsack with resource augmentation
• More on batched bin packing
• Online bin packing with resource augmentation
• The online knapsack problem: advice and randomization
• scientific article; zbMATH DE number 1670832 (Why is no real title available?)
• On Dynamic Bin Packing: An Improved Lower Bound and Resource Augmentation Analysis
• Optimal Resource Augmentations for Online Knapsack
• Interior-point-based online stochastic bin packing
• Approximation and Online Algorithms
• Tighter bounds for the harmonic bin packing algorithm
• Online unbounded knapsack
• Bin packing with rejection revisited
• Resource augmented semi-online bounded space bin packing
• Tight results for next fit and worst fit with resource augmentation

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

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