Abstract

If $n\geq 3$ and $d\in \{3,4\}$ or if $n\geq 1$ and $d\geq 5$, then any sequence of $d$-dimensional cubes of edge lengths not greater than $1$ whose total volume does not exceed $(n+1)\cdot 2^{-d}$ can be on-line packed into $n$ unit $d$-dimensional cubes

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

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.