The Robot Cleans Up

DOI10.1007/978-3-540-85097-7_29zbMath1168.68553OpenAlexW2100655974MaRDI QIDQ5505669

Margaret-Ellen Messinger, Richard J. Nowakowski

Publication date: 27 January 2009

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85097-7_29

zbMATH Keywords

greedy algorithmsearchingcleaning processedge traversing

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Eulerian and Hamiltonian graphs (05C45)

Related Items (2)

Parallel cleaning of a network with brushes ⋮ Bounds on the cleaning times of robot vacuums

Cites Work

• Cleaning a network with brushes
• Matching, Euler tours and the Chinese postman
• Cleaning Random d-Regular Graphs with Brushes Using a Degree-Greedy Algorithm
• Unnamed Item

This page was built for publication: The Robot Cleans Up