How often should you clean your room? - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2015

How often should you clean your room?

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.
Fichier principal
Vignette du fichier
dmtcs-17-1-27.pdf (412.01 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-01196853 , version 1 (10-09-2015)

Identifiers

Cite

Kimball Martin, Krishnan Shankar. How often should you clean your room?. Discrete Mathematics and Theoretical Computer Science, 2015, Vol. 17 no. 1 (1), pp.415-—444. ⟨10.46298/dmtcs.2109⟩. ⟨hal-01196853⟩

Collections

TDS-MACS
43 View
948 Download

Altmetric

Share

Gmail Facebook X LinkedIn More