Optimal constrained graph exploration

ACM Transactions on Algorithms

Volumn 2, Issue 3, 2006, Pages 380-402

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

^a UNIVERSITY OF MIAMI   (United States)

^b UNIVERSITY OF ARIZONA   (United States)

^c VIRGINIA POLYTECHNIC INSTITUTE AND STATE UNIVERSITY   (United States)

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

^e University of Arizona   (United States)

^f Virginia Polytechnic Institute and State University   (United States)

Author keywords

Computational learning theory; Graph exploration

Indexed keywords

COMPUTATIONAL LEARNING THEORY; GRAPH EXPLORATION; TANK CAPACITY; TETHERED ROBOTS;

ALGORITHMS; COMPUTATION THEORY; FUEL TANKS; PROBLEM SOLVING; ROBOTS;

GRAPH THEORY;

EID: 33749000268     PISSN: 15496325     EISSN: 15496333     Source Type: Journal    
DOI: 10.1145/1159892.1159897     Document Type: Article

References (23)

1. ALBERS, S., AND HENZINGER, M. R. 1999. Exploring unknown environments. SIAM J. Comput. 29, 4, 1164-1188.
2. AVERBAKH, I., AND HERMAN, O. 1996. A heuristic with worst-case analysis for minimax routing of two travelling salesmen on a tree. Disc. Appl. Math. 68, 1-2, 17-32.
3. AVERBAKH, I., AND BERMAN, O. 1997. (p - 1)/(p + 1)-approximate algorithms for p-traveling salesmen problems on a tree with minmax objective. Disc. Appl. Math. 75, 3, 201-216.
4. AWERBUCH, B., BERGER, B., COWEN, L., AND PELEG, D. 1999a. Near-linear time construction of sparse neighborhood covers. SIAM J. Comput. 28, 1 (Feb.), 263-277.
5. AWERBUCH, B., BETKE, M., RIVEST, R. L., AND SINGH, M. 1999b. Piecemeal graph exploration by a mobile robot. Inf. Comput. 152, 2, 155-172.
6. AWERBUCH, B., AND KOBOUROV, S. 1998. Polylogarithmic-overhead piecemeal graph exploration. In Proceedings of the 11th Annual Conference on Computational Learning Theory (COLT). 280-286.
7. BAR-ELI, E., BERMAN, P., FIAT, A., AND YAN, P. 1994. On-line navigation in a room. J. Algorithms 17, 3, 319-341.
8. BENDER, M. A., FERNÁNDEZ, A., RON, D., SAHAI, A., AND VADHAN, S. P. 2002. The power of a pebble: Exploring and mapping directed graphs. Inf. Comput. 176, 1, 1-21.
9. BENDER, M. A., AND SLONIM, D. K. 1994. 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). IEEE Computer Society Press, Los Alamitos, CA, 75-87.
10. BERMAN, P., BLUM, A., FIAT, A., KARLOFF, H., ROSÉN, A., AND SAKS, M. 1996. Randomized robot navigation algorithms. In Proceedings of the 7th Annual Symposium on Discrete Algorithms (SODA). ACM, New York, 75-84.
11. BETKE, M., RIVEST, R. L., AND SINGH, M. 1995. Piecemeal learning of an unknown environment. Mach. Learn. 18, 2/3, 231-254.
12. BLUM, A., AND CHALASANI, P. 2000. An online algorithm for improving performance in navigation. SIAM J. Comput. 29, 6, 1907-1938.
13. BLUM, A., RAGHAVAN, P., AND SCHIEBER, B. 1997. Navigating in unfamiliar geometric terrain. SIAM J. Comput. 26, 1 (Feb.), 110-137.
14. CORMEN, T. H., LEISERSON, C. E., RIVEST, R. L., AND STEIN, C. 1990. Introduction to Algorithms. MIT Press/McGraw-Hill, New York.
15. DENG, X., KAMEDA, T., AND PAPADIMITRIOU, C. 1998. How to learn an unknown environment. I: the rectilinear case. J. ACM 45, 2 (Mar.), 215-245.
16. DENG, X., AND PAPADIMITRIOU, C. 1999. Exploring an unknown graph. J. Graph Theory 32, 265-297.
17. DUNCAN, C. A., KOBOUROV, S. G., AND KUMAR, V. S. A. 2001. Optimal constrained graph exploration. In Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms (SODA). ACM, New York, 807-814.
18. FRAIGNIAUD, P., GASIENIEC, L., KOWALSKI, D. R., AND PELC, A. 2004. Collective tree exploration. In LATIN. 141-151.
19. HOFFMANN, F., ICKING, C., KLEIN, R., AND KRIEGEL, K. 2002. The polygon exploration problem. SIAM J. Comput. 31, 2 (Apr.), 577-600.
20. PANAITE, P., AND PELC, A. 1999. Exploring unknown undirected graphs. J. Algorithms 33, 2, 281-295.
21. PAPADIMITRIOU, C., AND YANAKAKIS, M. 1991. Shortest paths without a map. Theoret. Comput. Sci. 84, 127-150.
22. RAO, N. S. V., KARETI, S., SHI, W., AND IYENGAR, S. S. 1993. Robot navigation in unknown terrains: Introductory survey of non-heuristic algorithms. Tech. Rep., Oak Ridge National Laboratory. July. ORNL/TM-12410.
23. RIVEST, R. L., AND SCHAPIRE, R. E. 1993. Inference of finite automata using homing sequences. Inf. Comput. 103, 2, 299-347.