The robot cleans up

DOI10.1007/s10878-009-9236-7zbMath1187.90307OpenAlexW2796790483MaRDI QIDQ849139

Richard J. Nowakowski, Margaret-Ellen Messinger

Publication date: 24 February 2010

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-009-9236-7

zbMATH Keywords

searchinggreedy algorithmscleaning processedge traversing

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items (3)

The robot crawler graph process ⋮ Perfect matchings and Hamiltonian cycles in the preferential attachment model ⋮ Parallel cleaning of a network with brushes

Cites Work

• Unnamed Item
• Cleaning a network with brushes
• Complexity of Langton's ant
• Matching, Euler tours and the Chinese postman
• Arc Routing Problems, Part I: The Chinese Postman Problem
• Cleaning Random d-Regular Graphs with Brushes Using a Degree-Greedy Algorithm

This page was built for publication: The robot cleans up