Tight bounds for NF-based bounded-space online bin packing algorithms

DOI10.1007/S10878-017-0175-4zbMath1393.90100OpenAlexW2755268351MaRDI QIDQ1702819

József Békési, Gábor Galambos

Publication date: 1 March 2018

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-017-0175-4

zbMATH Keywords

lower boundasymptotic competitive rationext-fitbounded-spacesemi-online bin-packing

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• New lower bounds for certain classes of bin packing algorithms
• Online bin packing problem with buffer and bounded size revisited
• Resource augmented semi-online bounded space bin packing
• An improved lower bound for on-line bin packing algorithms
• Repacking helps in bounded space on-line bin-packing
• Batched bin packing
• NF-based algorithms for online bin packing with buffer and bounded item size
• On-line bin packing with restricted repacking
• On the online bin packing problem
• Parametric Lower Bound for On-Line Bin-Packing
• Beating the Harmonic Lower Bound for Online Bin Packing

This page was built for publication: Tight bounds for NF-based bounded-space online bin packing algorithms