Online graph exploration algorithms for cycles and trees by multiple searchers
From MaRDI portal
Publication:2251142
DOI10.1007/s10878-012-9571-yzbMath1291.90279OpenAlexW2084346109MaRDI QIDQ2251142
Yuya Higashikawa, Shin-ichi Tanigawa, Stefan Langerman, Naoki Katoh
Publication date: 11 July 2014
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-012-9571-y
Related Items (11)
An improved lower bound for competitive graph exploration ⋮ Multi-round cooperative search games with multiple players ⋮ Strategies for parallel unaware cleaners ⋮ The beachcombers' problem: walking and searching with mobile robots ⋮ Unnamed Item ⋮ Brief Announcement: Efficient Collaborative Tree Exploration with Breadth-First Depth-Next ⋮ Unnamed Item ⋮ A general lower bound for collaborative tree exploration ⋮ Beachcombing on strips and islands ⋮ Chaotic Traversal (CHAT): Very Large Graphs Traversal Using Chaotic Dynamics ⋮ Fast collaborative graph exploration
Cites Work
- Algorithms for the on-line quota traveling salesman problem
- Constructing competitive tours from local information
- \((p-1)/(p+1)\)-approximate algorithms for \(p\)-traveling salesmen problems on a tree with minmax objective
- Approximating the minmax rooted-tree cover in a tree
- The Polygon Exploration Problem
- The Online TSP Against Fair Adversaries
- Online Graph Exploration with Advice
- Optimal constrained graph exploration
- Online Graph Exploration: New Results on Old and New Algorithms
- Collective tree exploration
- Competitive Online Approximation of the Optimal Search Ratio
- Exploring an unknown graph
- Exploring Unknown Undirected Graphs
- Exploring Unknown Environments
- Why Robots Need Maps
- Algorithms – ESA 2005
- Smart Robot Teams Exploring Sparse Trees
- Algorithms for the on-line travelling salesman
This page was built for publication: Online graph exploration algorithms for cycles and trees by multiple searchers
