Collective tree exploration

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2976, Issue , 2004, Pages 141-151

  Fraigniaud, Pierre ^a   Gasieniec, Leszek ^b   Kowalski, Dariusz R ^c,d   Pelc, Andrzej ^e  

^a CNRS   (France)

^b UNIVERSITY OF LIVERPOOL   (United Kingdom)

^c MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^d UNIVERSITY OF WARSAW   (Poland)

^e UNIVERSITÉ DU QUÉBEC EN OUTAOUAIS   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

FORESTRY; MOBILE AGENTS; ROBOTS;

DISTRIBUTED EXPLORATION; EXPLORATION ALGORITHMS; RUNNING TIME; SUBLINEAR;

TREES (MATHEMATICS);

EID: 27644440909     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24698-5_18     Document Type: Article

References (24)

1. S. Albers and M. R. Henzinger, Exploring unknown environments, SIAM Journal on Computing, (2000), 1164-1188.
2. E. Arkin, M. Bender, S. Fekete, J. Mitchell, and M. Skutella, The freeze-tag problem: How to wake up a swarm of robots, In 13th ACM-SIAM Symp. on Disc. Alg. (SODA'02), 568-577.
3. E. Arkin, M. Bender, D. Ge, S. He, and J. Mitchell. Improved approximation algorithms for the freeze-tag problem. In 15th ACM Symp. on Par. in Alg. and Arch. (SPAA'03), 295-303.
4. I. Averbakh and O. Berman, A heuristic with worst-case analysis for minimax routing of two traveling salesmen on a tree, Discr. Appl. Mathematics, 68 (1996), 17-32.
5. I. Averbakh and O. Berman, (p-1)/(p+1)-approximate algorithms for p-traveling salesmen problems on a tree with minmax objective, Discr. Appl. Mathematics, 75 (1997), 201-216.
6. B. Awerbuch, M. Betke, R. Rivest and M. Singh, Piecemeal graph learning by a mobile robot, In 8th Conf. on Comput. Learning Theory (COLT'95), 321-328.
7. E. Bar-Eli, P. Berman, A. Fiat and R. Yan, On-line navigation in a room, Journal of Algorithms, 17 (1994), 319-341.
8. M. A. Bender, A. Fernandez, D. Ron, A. Sahai and S. Vadhan, The power of a pebble: Exploring and mapping directed graphs, In 30th Ann. Symp. on Theory of Comp. (STOC'98), 269-278.
9. M. A. Bender and D. Slonim, The power of team exploration: Two robots can learn unlabeled directed graphs, In 35th Ann. Symp. on Foundations of Comp. Science (FOCS'96), 75-85.
10. P. Berman, A. Blum, A. Fiat, H. Karloff, A. Rosen and M. Saks, Randomized robot navigation algorithms, In 7th ACM-SIAM Symp. on Discrete Algorithms (SODA'96), 74-84.
11. A. Blum, P. Raghavan and B. Schieber, Navigating in unfamiliar geometric terrain, SIAM Journal on Computing, 26 (1997), 110-137.
12. M. Betke, R. Rivest and M. Singh, Piecemeal learning of an unknown environment, Machine Learning, 18 (1995), 231-254.
13. X. Deng, T. Kameda and C. H. Papadimitriou, How to learn an unknown environment I: the rectilinear case, Journal of the ACM, 45 (1998), 215-245.
14. X. Deng and C. H. Papadimitriou, Exploring an unknown graph, J. of Graph Th., 32 (1999), 265-297.
15. A. Dessmark and A. Pelc, Optimal graph exploration without good maps, In 10th European Symposium on Algorithms (ESA'02), 374-386.
16. K. Diks, P. Fraigniaud, E. Kranakis and A. Pelc, Tree exploration with little memory, In 13th Ann. ACM-SIAM Symposium on Discrete Algorithms (SODA'02), 588-597.
17. C.A. Duncan, S.G. Kobourov and V.S.A. Kumar, Optimal constrained graph exploration, In 12th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA'01), 807-814.
18. G. N. Frederickson, M. S. Hecht and C. E. Kim, Approximation algorithms for some routing problems, SIAM J. on Computing, 7 (1978), 178-193.
19. M. Garey, and D. Johnson, Computers and Intractability, W.H. Freeman and Company, New York, 1979.
20. A. Lopez-Ortiz and S. Schuierer, On-line Parallel Heuristics and Robot Searching under the Competitive Framework. In 8th Scandinavian Work, on Alg. Theory (SWAT'02), 260-269.
21. P. Panaite and A. Pelc, Exploring unknown undirected graphs, J. of Algorithms, 33 (1999), 281-295.
22. C. H. Papadimitriou and M. Yannakakis, Shortest paths without a map, Theoretical Computer Science, 84 (1991), 127-150.
23. N. S. V. Rao, S. Hareti, W. Shi and S.S. Iyengar, Robot navigation in unknown terrains: Introductory survey of non-heuristic algorithms, Tech. Rep. ORNL/TM-12410, Oak Ridge National Laboratory, July 1993.
24. S. Schuierer, On-line searching in geometric trees, In Sensor Based Intelligent Robots, LNAI 1724, 1999, 220-239.