# How often should you clean your room?

- Published in 2013
- Added on

In the collection

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.

## Links

## Other information

- pages
- 28

### BibTeX entry

@article{Martin2013, 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.}, author = {Martin, Kimball and Shankar, Krishnan}, month = {may}, pages = 28, title = {How often should you clean your room?}, url = {http://arxiv.org/abs/1305.1984 http://arxiv.org/pdf/1305.1984v2}, year = 2013, archivePrefix = {arXiv}, eprint = {1305.1984}, primaryClass = {math.CO}, urldate = {2014-09-02}, collections = {Easily explained} }