Analysis of algorithms (68W40) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)
Recommendations
Cites work
- scientific article; zbMATH DE number 1187157 (Why is no real title available?)
- scientific article; zbMATH DE number 2114378 (Why is no real title available?)
- A 2.5 times optimal algorithm for packing in two dimensions
- A Strip-Packing Algorithm with Absolute Performance Bound 2
- A algorithm for two-dimensional packing
- A note on online strip packing
- A simple proof of Liang's lower bound for on-line bin packing and the extension to the parametric case
- An Exact Algorithm for Higher-Dimensional Orthogonal Packing
- An improved lower bound for on-line bin packing algorithms
- Bounds on Multiprocessing Timing Anomalies
- Lower bounds for on-line two-dimensional packing algorithms
- New Lower Bounds for Certain Classes of Bin Packing Algorithms
- On Two Dimensional Packing
- On the online bin packing problem
- On-line bin packing ? A restricted survey
- Online Square Packing
- Online square and cube packing
- Orthogonal Packings in Two Dimensions
- Packing rectangles in a strip
- Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
- Shelf Algorithms for Two-Dimensional Packing Problems
- Shelf algorithms for on-line strip packing
- Strip Packing vs. Bin Packing
- TETRIS IS HARD, EVEN TO APPROXIMATE
Cited in
(4)
This page was built for publication: Online square packing with gravity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q476449)
