Rectangle packing with additional restrictions
From MaRDI portal
Publication:650936
DOI10.1016/j.tcs.2011.09.007zbMath1227.68032MaRDI QIDQ650936
Publication date: 7 December 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2011.09.007
68Q25: Analysis of algorithms and problem complexity
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Cites Work
- Unnamed Item
- Unnamed Item
- Optimal rectangle packing
- On packing squares into a rectangle
- A typology of cutting and packing problems
- Jigsaw puzzles, edge matching, and polyomino packing: Connections and complexity
- A new constraint programming approach for the orthogonal packing problem
- An improved typology of cutting and packing problems
- A new exact method for the two-dimensional orthogonal packing problem
- MPQ-trees for orthogonal packing problem
- Reducibility Among Combinatorial Problems
- A GENERALIZATION OF A THEOREM OF KLEITMAN AND KRIEGER
- A Theorem of Sylvester and Schur
- Some packing and covering theorems
- On packing of squares and cubes