On Partitions of a Rectangle into Rectangles with Restricted Number of Cross Sections

DOI10.1007/11889342_60MaRDI QIDQ5504237zbMATH OpenOpenAlexFDO

Authors Alexander A. Yudin, Rudolf Ahlswede

Publication date 22 January 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11889342_60

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40) Information theory (general) (94A15)

Recommendations

• On partitions of a rectangle into rectangles with restricted number of cross sections
• scientific article; zbMATH DE number 431514
• scientific article; zbMATH DE number 4075941
• Two-dimensional partitions
• Partitioning a rectangle into small perimeter rectangles

Cited in

(8)

• Two-dimensional partitions
• Partition problems in high dimensional boxes
• Brick partition problems in three dimensions
• scientific article; zbMATH DE number 431514 (Why is no real title available?)
• On partitions of a rectangle into rectangles with restricted number of cross sections
• scientific article; zbMATH DE number 4075941 (Why is no real title available?)
• scientific article; zbMATH DE number 6469215 (Why is no real title available?)
• The structure of rectangle families dividing the plane into maximum number of atoms

This page was built for publication: On Partitions of a Rectangle into Rectangles with Restricted Number of Cross Sections

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5504237)