Improved lower bound for online strip packing
From MaRDI portal
Publication:2344211
DOI10.1007/S00224-013-9494-8zbMATH Open1328.68316OpenAlexW1979060810MaRDI QIDQ2344211FDOQ2344211
Authors: Rolf Harren, Walter Kern 
Publication date: 12 May 2015
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-013-9494-8
Recommendations
Online algorithms; streaming algorithms (68W27) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cites Work
- Lower bounds for on-line two-dimensional packing algorithms
- Shelf algorithms for on-line strip packing
- Shelf Algorithms for Two-Dimensional Packing Problems
- Orthogonal Packings in Two Dimensions
- A note on online strip packing
- Improved lower bound for online strip packing
- A tight analysis of Brown-Baker-Katseff sequences for online strip packing
- Online Algorithm for Parallel Job Scheduling and Strip Packing
- Scheduling parallel jobs to minimize the makespan
- Online scheduling of parallel jobs on two machines is 2-competitive
- Online matching on a line
- Strip Packing vs. Bin Packing
Cited In (9)
- New upper bounds for online strip packing
- A new upper bound for the online square packing problem in a strip
- A new lower bound for online strip packing
- Improved Lower Bound for Online Strip Packing
- A note on online strip packing
- Parameterized complexity of strip packing and minimum volume packing
- A lower bound for online rectangle packing
- Improved lower bound for online strip packing
- A tight analysis of Brown-Baker-Katseff sequences for online strip packing
This page was built for publication: Improved lower bound for online strip packing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2344211)
