Expected wasted space of optimal simple rectangle packing
Random rectangles are packed in the unit square without overlapping and with the additional property called ``simple, which means that each vertical line can intersect at most one rectangle. This paper aims at improving the result of \textit{W. T. Rhee} [Ann. Appl. Probab. 10, 539--548 (2000; Zbl 1051.60012)] for the expected waste space of optimal simple rectangle packing in the unit square. The main result states that the expected waste space \(E(W_n)\) (\(n\) being the rectangles packed) satisfies \(\log E(W_n) = -\frac12\log n + \sqrt{\log 2\log n}+O(\log\log n)\).
- Optimal rectangle packing
- On rectangle packing, maximizing benefits
- Optimal rectangle packing: an absolute placement approach
- Algorithms and Computation
- Publication:4508386
- Packing rectangles into the unit square
- On packing of rectangles in a rectangle
- A least wasted first heuristic algorithm for the rectangular packing problem
- Efficient packing of unit squares in a square
- Optimal packings of unit squares in a square
- scientific article; zbMATH DE number 52589 (Why is no real title available?)
- scientific article; zbMATH DE number 1340282 (Why is no real title available?)
- Packing random intervals
- Packing random intervals
- Packing Random Rectangles of Given Volume
- Packing rectangles and intervals∗
- The random weighted interval packing problem: The intermediate density case.
This page was built for publication: Expected wasted space of optimal simple rectangle packing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1769075)