Improved lower bound for online strip packing
From MaRDI portal
(Redirected from Publication:2344211)
Recommendations
Cites work
- A note on online strip packing
- A tight analysis of Brown-Baker-Katseff sequences for online strip packing
- Improved lower bound for online strip packing
- Lower bounds for on-line two-dimensional packing algorithms
- Online Algorithm for Parallel Job Scheduling and Strip Packing
- Online matching on a line
- Online scheduling of parallel jobs on two machines is 2-competitive
- Orthogonal Packings in Two Dimensions
- Scheduling parallel jobs to minimize the makespan
- Shelf Algorithms for Two-Dimensional Packing Problems
- Shelf algorithms for on-line strip packing
- 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)