On a Square Packing Problem
DOI10.1017/S0963548301005041zbMATH Open1005.60021OpenAlexW1967388228WikidataQ58374474 ScholiaQ58374474MaRDI QIDQ3147273FDOQ3147273
Authors: Stéphane Boucheron, W. Fernandez de la Vega
Publication date: 21 October 2002
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0963548301005041
Recommendations
Combinatorial optimization (90C27) Combinatorial probability (60C05) Combinatorial aspects of packing and covering (05B40) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)
Cited In (8)
- An algorithm for packing squares
- Valid constraints for the Point Packing in a Square problem
- On packing squares with equal squares
- On the square peg problem and its relatives
- A Square-Packing Problem of Erdoes
- Title not available (Why is that?)
- How many contacts can exist between oriented squares of various sizes?
- Random packings by cubes
This page was built for publication: On a Square Packing Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3147273)