Abstract
Consider a probability measure $\mu$ on $[0, 1]$ and independent identically distributed random variables $X_1,\cdots, X_n$ distributed according to $\mu$. Denote by $Q_n = Q_n (X_1,\cdots, X_n)$ the minimum number of unit-size bins needed to pack items of size $X_1,\cdots, X_n$. Previous estimates of $Q_n$ are considerably improved and simplified. Similar estimates are obtained for the maximum number of unit-size bins that can be covered by $X_1,\cdots, X_n$.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.