Author:
Förster Klaus-Tycho,Wattenhofer Roger
Publisher
Springer Berlin Heidelberg
Reference37 articles.
1. Albers, S., Henzinger, M.R.: Exploring Unknown Environments. SIAM J. Comput. 29(4), 1164–1188 (2000)
2. Asadpour, A., Goemans, M.X., Madry, A., Gharan, S.O., Saberi, A.: An O(log n/log log n)-approximation Algorithm for the Asymmetric Traveling Salesman Problem. In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010, pp. 379–389. Society for Industrial and Applied Mathematics, Philadelphia (2010)
3. Ausiello, G., Bonifaci, V., Laura, L.: The on-line asymmetric traveling salesman problem. J. Discrete Algorithms 6(2), 290–298 (2008)
4. Baldoni, R., Bonnet, F., Milani, A., Raynal, M.: Anonymous graph exploration without collision by mobile robots. Inf. Process. Lett. 109(2), 98–103 (2008)
5. Flocchini, P., Fraigniaud, P., Santoro, N.: Capture of an intruder by mobile agents. In: Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 2002, pp. 200–209. ACM, New York (2002)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Two-Agent Tree Evacuation;Structural Information and Communication Complexity;2021
2. Collaboration Without Communication: Evacuating Two Robots from a Disk;Lecture Notes in Computer Science;2017
3. Treasure Hunt with Advice;Structural Information and Communication Complexity;2015
4. A Recursive Approach to Multi-robot Exploration of Trees;Structural Information and Communication Complexity;2014
5. Fault-Tolerant ANTS;Lecture Notes in Computer Science;2014