Directed Graph Exploration
We study the problem of exploring all nodes of an unknown directed graph. A searcher has to construct a tour that visits all nodes, but only has information about the parts of the graph it already visited. The goal is to minimize the cost of such a tour. In this paper, we present upper and lower bounds for both the deterministic and the randomized online version of exploring all nodes of directed graphs. Our bounds are sharp or sharp up to a small constant, depending on the specific model. Essentially, exploring a directed graph has a multiplicative overhead linear in the number of nodes. If one wants to search for just a node in unweighted directed graphs, a greedy algorithm with quadratic multiplicative overhead can only be improved by a factor of at most two. We were also able to show that randomly choosing a starting point does not improve lower bounds beyond a small constant factor.
Keywordsonline algorithms graph exploration mobile agents and autonomous robots
Unable to display preview. Download preview PDF.
- 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)Google Scholar
- 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)Google Scholar
- 7.Brass, P., Gasparri, A., Cabrera-Mora, F., Xiao, J.: Multi-robot tree and graph exploration. In: Proceedings of the 2009 IEEE International Conference on Robotics and Automation, ICRA 2009, pp. 495–500. IEEE Press, Piscataway (2009)Google Scholar
- 8.Bläser, M.: A new approximation algorithm for the asymmetric TSP with triangle inequality. ACM Transactions on Algorithms 4(4), 47:1–47:15 (2008)Google Scholar
- 11.Burgard, W., Moors, M., Fox, D., Simmons, R.G., Thrun, S.: Collaborative Multi-Robot Exploration. In: Proceedings of the 2000 IEEE International Conference on Robotics and Automation, ICRA 2000, pp. 476–481. IEEE, San Francisco (2000)Google Scholar
- 28.Kaplan, H., Lewenstein, M., Shafrir, N., Sviridenko, M.: Approximation Algorithms for Asymmetric TSP by Decomposing Directed Regular Multigraphs. In: Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2003, pp. 56–65. IEEE Computer Society, Washington, DC (2003)CrossRefGoogle Scholar
- 30.Kutten, S.: Stepwise construction of an efficient distributed traversing algorithm for general strongly connected directed networks or: Traversing one way streets with no map. In: Computer Communication Technologies for the 90’s, Proceedings of the Ninth International Conference on Computer Communication, ICCC 1988, pp. 446–452. International Council for Computer Communication, Elsevier (1988)Google Scholar
- 32.Miyazaki, S., Morimoto, N., Okabe, Y.: The Online Graph Exploration Problem on Restricted Graphs. IEICE Transactions 92-D(9), 1620–1627 (2009)Google Scholar