Rectangle packing with additional restrictions

DOI10.1016/J.TCS.2011.09.007zbMath1227.68032OpenAlexW1966475068MaRDI QIDQ650936

Jens Maßberg, Jan Schneider

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

zbMATH Keywords

NP-completenessrectangle packing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

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

This page was built for publication: Rectangle packing with additional restrictions