Optimal constrained graph exploration

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2001, Pages 807-814

  Duncan, Christian A ^a   Kobourov, Stephen G ^b   Anil Kumar, V S ^c  

^a Department of Computer Science and Center for Computational Science   (United States)

^b University of Arizona   (United States)

^c MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

Algorithms; Design; Performance; Theory; Verification

Indexed keywords

EID: 65549083863     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. Susanne Albers , Monika R. Henzinger, Exploring unknown environments, Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, p.416-425, May 04-06, 1997, El Paso, Texas, United States [doi〉10.1145/ 258533.258630]
2. B. AWERBUCH, B. BERGER, L. COWEN, AND D. PE- LEG, Near-linear cost sequential and distribured constructions of sparse neighborhood covers, in Proceedings of the 34th Annual Symposium on Foundations of Computer Science (FOCS), 1993, pp. 638-647.
3. Baruch Awerbuch , Margrit Betke, Piecemeal graph exploration by a mobile robot, Information and Computation, v.152 n.2, p.155-172, Aug. 1, 1999 [doi〉10.1006/inco.1999.2795]
4. Baruch Awerbuch , Stephen G. Kobourov, Polylogarithmic-overhead piecemeal graph exploration, Proceedings of the eleventh annual conference on Computational learning theory, p.280-286, July 24-26, 1998, Madison, Wisconsin, United States [doi〉10.1145/279943.279998]
5. E. Bar-Eli , Piotr Berman , A. Fiat , Peiyuan Yan, On-line navigation in a room, Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms, p.237-249, September 1992, Orlando, Florida, United States
6. M. A. BENDER AND D. K. SLONIM, The power of team exploration: Two robots can learn unlabeled directed graphs, in Proceedings of the 35th Annual Symposium on Foundations of Computer Science (FOCS), 1994, pp. 75-87.
7. Piotr Berman , Avrim Blum , Amos Fiat , Howard Karloff , Adi Rosén , Michael Saks, Randomized robot navigation algorithms, Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms, p.75-84, January 28-30, 1996, Atlanta, Georgia, United States
8. Margrit Betke , Ronald L. Rivest , Mona Singh, Piecemeal learning of an unknown environment, Proceedings of the sixth annual conference on Computational learning theory, p.277-286, July 26-28, 1993, Santa Cruz, California, United States [doi〉10.1145/168304.168352]
9. A. BLUM AND P. CHALASANI, An online algorithm for improving performance in navigation, in Proceesings of the Thirty-Fourth Annual Symposium on Foundations of Computer Science (FOCS), 1994, pp. 2-11.
10. Avrim Blum , Prabhakar Raghavan , Baruch Schieber, Navigating in unfamiliar geometric terrain, Proceedings of the twenty-third annual ACM symposium on Theory of computing, p.494-504, May 05-08, 1991, New Orleans, Louisiana, United States [doi〉10.1145/103418.103419]
11. Thomas T. Cormen , Charles E. Leiserson , Ronald L. Rivest, Introduction to algorithms, MIT Press, Cambridge, MA, 1990
12. Xiaotie Deng , Tiko Kameda , Christos Papadimitriou, How to learn an unknown environment (extended abstract), Proceedings of the 32nd annual symposium on Foundations of computer science, p.298-303, September 1991, San Juan, Puerto Rico [doi〉10.1109/SFCS.1991.185382]
13. X. DENG AND C. H. PAPADIMITRIOU, Exploring an unknown graph, in Proceedings of the 31st Symposium on Foundations of Computer Science (FOCS), 1990, pp. 355-361. (Also in Journal of Graph Theory, 32(3):265-297, 1999).
14. Frank Hoffmann , Christian Icking , Rolf Klein , Klaus Kriegel, A competitive strategy for learning a polygon, Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms, p.166-174, January 05-07, 1997, New Orleans, Louisiana, United States 15 Petrisor Panaite , Andrzej Pelc, Exploring unknown undirected graphs, Journal of Algorithms, v.33 n.2, p.281-295, Nov. 1999 [doi〉10.1006/jagm.1999.1043]
15. Christos H. Papadimitriou , Mihalis Yannakakis, Shortest paths without a map, Theoretical Computer Science, v.84 n.1, p.127-150, July 22, 1991 [doi〉10.1016/0304-3975(91) 90263-2]
16. N. S. V. RAO, S. KARETI, W. SHI, AND S. S. IYEN- GAR, Robot navigation in unknown terrains: Introductory survey of non-heuristic algorithms, tech. rep., July 1993. ORNL/TM-12410.
17. R. L. Rivest , R. E. Schapire, Inference of finite automata using homing sequences, Proceedings of the twenty-first annual ACM symposium on Theory of computing, p.411-420, May 14-17, 1989, Seattle, Washington, United States [doi〉10.1145/73007.73047]