Order of decay of the wasted space for a stochastic packing problem.
type: Item
instance of: scholarly article
title: Order of decay of the wasted space for a stochastic packing problem.
zbMATH Open document ID: 1051.60012
author: Wansoo T. Rhee
published in: The Annals of Applied Probability
publication date: 2004-10-27T00:00:00Z
review text: This paper considers successive packing in the unit square of random rectangles with the additional property (called ``simple'' in the paper) that each vertical line drawn in the square can intersect at most one rectangle. The main result states that \[ \log E(W_N) \geq -\tfrac12\log N + K \sqrt{\log N}, \] for large enough \(N\) and some constant \(K>0\). In a separate paper the author [Int. J. Comput. Math. 76, No. 4, 479--488 (2001; Zbl 0986.60012)] also proved the upper bound \[ \log E(W_N) \leq -\frac12 \log N + O(\sqrt{\log N}). \] Recently, \textit{M. Talagrand} [Expected wasted space of optimal simple rectangle packing, Probab. Theory Relat. Fields (in press)] improved the above results by showing that \[ \log E(W_n) = -\tfrac12\log N + \sqrt{\log 2\log N} +O(\log\log N), \] where the implied constant in the \(O\)-symbol is less than \(1/2\).
reviewed by: Hsien-Kuei Hwang
Mathematics Subject Classification ID: 60D05
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 2110914
zbMATH Keywords: rectangle packing
zbMATH Keywords: Poisson processes
zbMATH Keywords: optimal packing
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1214/aoap/1019487354
OpenAlex ID: W2028785926
cites work: Q4002885
cites work: Packing random rectangles
cites work: Packing random intervals
cites work: Tight bound of random interval packing
cites work: Packing rectangles and intervals∗
DOI: 10.1214/AOAP/1019487354
description: scientific article; zbMATH DE number 2110914