Strategies for parallel unaware cleaners
type: Item
instance of: scholarly article
title: Strategies for parallel unaware cleaners
zbMATH Open document ID: 1332.68260
author: Christian Ortolf
author: Christian Schindelhauer
published in: Theoretical Computer Science
publication date: 2015-12-11T00:00:00Z
Mathematics Subject Classification ID: 68T42
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 6520530
zbMATH Keywords: visit time
zbMATH Keywords: competitive analysis
zbMATH Keywords: mobile agent
zbMATH Keywords: multi-robot graph exploration
MaRDI profile type: Publication
full work available at URL: j.tcs.2015.09.026
OpenAlex ID: W2172569513
cites work: Searching in the plane
cites work: Q4103312
cites work: Fast Collaborative Graph Exploration
cites work: Smart Robot Teams Exploring Sparse Trees
cites work: Why Robots Need Maps
cites work: A tight bound on approximating arbitrary metrics by tree metrics
cites work: Collective tree exploration
cites work: Transformation of multidepot multisalesmen problem to the standard travelling salesman problem
cites work: Online graph exploration algorithms for cycles and trees by multiple searchers
cites work: Reducibility Among Combinatorial Problems
cites work: Q4878667
cites work: The Double Dixie Cup Problem
cites work: The Euclidean traveling salesman problem is NP-complete
DOI: 10.1016/J.TCS.2015.09.026
description: scientific article; zbMATH DE number 6520530