Online square packing with gravity
DOI10.1007/S00453-012-9713-8zbMATH Open1317.68248OpenAlexW1983284476MaRDI QIDQ476449FDOQ476449
Authors: 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
Recommendations
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)
Cites Work
- On the online bin packing problem
- Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
- A Strip-Packing Algorithm with Absolute Performance Bound 2
- Bounds on Multiprocessing Timing Anomalies
- Lower bounds for on-line two-dimensional packing algorithms
- An improved lower bound for on-line bin packing algorithms
- Shelf algorithms for on-line strip packing
- Shelf Algorithms for Two-Dimensional Packing Problems
- Orthogonal Packings in Two Dimensions
- A algorithm for two-dimensional packing
- A note on online strip packing
- A 2.5 times optimal algorithm for packing in two dimensions
- Title not available (Why is that?)
- An Exact Algorithm for Higher-Dimensional Orthogonal Packing
- New Lower Bounds for Certain Classes of Bin Packing Algorithms
- Title not available (Why is that?)
- On Two Dimensional Packing
- A simple proof of Liang's lower bound for on-line bin packing and the extension to the parametric case
- Online square and cube packing
- Packing rectangles in a strip
- Online Square Packing
- TETRIS IS HARD, EVEN TO APPROXIMATE
- On-line bin packing ? A restricted survey
- Strip Packing vs. Bin Packing
Cited In (5)
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)
