Online square packing with gravity
From MaRDI portal
Publication:476449
DOI10.1007/S00453-012-9713-8zbMath1317.68248OpenAlexW1983284476MaRDI QIDQ476449
Sándor P. Fekete, Tom Kamphans, Nils Schweer
Publication date: 2 December 2014
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-012-9713-8
Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (2)
The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview ⋮ Online square-into-square packing
Cites Work
- Unnamed Item
- Unnamed Item
- Shelf algorithms for on-line strip packing
- A note on online strip packing
- A 2.5 times optimal algorithm for packing in two dimensions
- Lower bounds for on-line two-dimensional packing algorithms
- An improved lower bound for on-line bin packing algorithms
- A simple proof of Liang's lower bound for on-line bin packing and the extension to the parametric case
- Packing rectangles in a strip
- Online square and cube packing
- New Lower Bounds for Certain Classes of Bin Packing Algorithms
- Online Square Packing
- An Exact Algorithm for Higher-Dimensional Orthogonal Packing
- On the online bin packing problem
- Shelf Algorithms for Two-Dimensional Packing Problems
- Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
- Orthogonal Packings in Two Dimensions
- A algorithm for two-dimensional packing
- A Strip-Packing Algorithm with Absolute Performance Bound 2
- On Two Dimensional Packing
- TETRIS IS HARD, EVEN TO APPROXIMATE
- On-line bin packing ? A restricted survey
- Strip Packing vs. Bin Packing
- Bounds on Multiprocessing Timing Anomalies
This page was built for publication: Online square packing with gravity
