How often should you clean your room?

Kimball Martin 1 Krishnan Shankar 1
1 Department of Mathematics [Norman]
OU - University of Oklahoma
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.
Type de document :
Article dans une revue
Discrete Mathematics and Theoretical Computer Science, DMTCS, 2015, Vol. 17 no. 1 (in progress) (1), pp.415-—444
Liste complète des métadonnées

Littérature citée [7 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01196853
Contributeur : Coordination Episciences Iam <>
Soumis le : jeudi 10 septembre 2015 - 15:17:14
Dernière modification le : lundi 30 octobre 2017 - 14:06:02
Document(s) archivé(s) le : mardi 29 décembre 2015 - 00:01:18

Fichier

dmtcs-17-1-27.pdf
Fichiers éditeurs autorisés sur une archive ouverte

Identifiants

  • HAL Id : hal-01196853, version 1

Collections

Citation

Kimball Martin, Krishnan Shankar. How often should you clean your room?. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2015, Vol. 17 no. 1 (in progress) (1), pp.415-—444. 〈hal-01196853〉

Partager

Métriques

Consultations de la notice

65

Téléchargements de fichiers

79