Subject
General Computer Science,Theoretical Computer Science
Reference63 articles.
1. Exploring unknown environments;Albers;SIAM J. Comput.,2000
2. An o(logn/loglogn)-approximation algorithm for the asymmetric traveling salesman problem;Asadpour,2010
3. The on-line asymmetric traveling salesman problem;Ausiello;J. Discrete Algorithms,2008
4. Anonymous graph exploration without collision by mobile robots;Baldoni;Inform. Process. Lett.,2008
5. Connected graph searching;Barrière;Inform. Sci.,2012
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Multi-agent Online Graph Exploration on Cycles and Tadpole Graphs;Lecture Notes in Computer Science;2024
2. Online algorithm for exploring a grid polygon with two robots;Proceedings of the 4th International Conference on Artificial Intelligence and Computer Engineering;2023-11-17
3. Exploring sparse graphs with advice;Information and Computation;2022-11
4. On the Price of Locality in Static Fast Rerouting;2022 52nd Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN);2022-06
5. Dispersion of Mobile Robots on Directed Anonymous Graphs;Structural Information and Communication Complexity;2022