How often should you clean your room?
Kimball Martin, Krishnan Shankar
Abstract
We introduce and study a combinatorial optimization problem motivated by the
question in the title. In the simple case where you use all objects in your room equally
often, we investigate asymptotics of the optimal time to clean up in terms of the number
of objects in your room. In particular, we prove a logarithmic upper bound, solve an approximate
version of this problem, and conjecture a precise logarithmic asymptotic.
Full Text: PDF PostScript