Bounds on the cleaning times of robot vacuums

We show a robot vacuum using a protocol that next cleans the "dirtiest" incident edge may take exponential time to clean a network. This disproves a conjecture of Messinger and Nowakowski [2]. We also present two simple variants of this protocol that are polynomial time.

• Type: Journal
• Year: 2010
• Where: ORL
• Authors: Zhentao Li, Adrian Vetta
• Keywords: Exponential Time, Incident Edge, Operations Research, ORL 2010, Robot Vacuum