Improved Lower Bound for Online Strip Packing
From MaRDI portal
Publication:2896391
DOI10.1007/978-3-642-29116-6_18zbMath1242.68379OpenAlexW2099119063MaRDI QIDQ2896391
Publication date: 16 July 2012
Published in: Approximation and Online Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-29116-6_18
Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Online algorithms; streaming algorithms (68W27)
Related Items
Approximation and online algorithms for multidimensional bin packing: a survey, The generalization of scheduling with machine cost, Improved upper bounds for online malleable job scheduling