Asymptotically optimal box packing theorems

MaRDI QIDQ1010801zbMATH OpenFDO

Authors J. Martínez

Publication date 7 April 2009

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/117253, http://www.emis.de/journals/EJC/Volume_15/Abstracts/v15i1r78.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

polyominoesbox packingprotoset

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40) Polyominoes (05B50)

Recommendations

• Klarner systems and tiling boxes with polyominoes
• Packing Boxes with Bricks
• Two problems about tiling in discrete geometry
• When can you tile a box with translates of two given rectangular bricks?
• Filling a box with translates of two bricks

Cited in

(7)

• Many L-shaped polyominoes have odd rectangular packings
• Klarner systems and tiling boxes with polyominoes
• Polynomials and packings: A new proof of de Bruijn's theorem
• scientific article; zbMATH DE number 3950202 (Why is no real title available?)
• Asymptotics of weighted best-packing on rectifiable sets
• Coloring and boundary invariants for polyominoes
• Packing polyominoes clumsily

This page was built for publication: Asymptotically optimal box packing theorems

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