
For FullText PDF, please login, if you are a member of IEICE,
or go to Pay Per View on menu list, if you are a nonmember of IEICE.

The Online Graph Exploration Problem on Restricted Graphs
Shuichi MIYAZAKI Naoyuki MORIMOTO Yasuo OKABE
Publication
IEICE TRANSACTIONS on Information and Systems
Vol.E92D
No.9
pp.16201627 Publication Date: 2009/09/01 Online ISSN: 17451361
DOI: 10.1587/transinf.E92.D.1620 Print ISSN: 09168532 Type of Manuscript: PAPER Category: Algorithm Theory Keyword: the graph exploration problem, online algorithm, competitive analysis,
Full Text: PDF(347.7KB)>>
Summary:
The purpose of the online graph exploration problem is to visit all the nodes of a given graph and come back to the starting node with the minimum total traverse cost. However, unlike the classical Traveling Salesperson Problem, information of the graph is given online. When an online algorithm (called a searcher) visits a node v, then it learns information on nodes and edges adjacent to v. The searcher must decide which node to visit next depending on partial and incomplete information of the graph that it has gained in its searching process. The goodness of the algorithm is evaluated by the competitive analysis. If input graphs to be explored are restricted to trees, the depthfirst search always returns an optimal tour. However, if graphs have cycles, the problem is nontrivial. In this paper we consider two simple cases. First, we treat the problem on simple cycles. Recently, Asahiro et al. proved that there is a 1.5competitive online algorithm, while no online algorithm can be (1.25ε)competitive for any positive constant ε. In this paper, we give an optimal online algorithm for this problem; namely, we give a (1.366)competitive algorithm, and prove that there is no (ε)competitive algorithm for any positive constant ε. Furthermore, we consider the problem on unweighted graphs. We also give an optimal result; namely we give a 2competitive algorithm and prove that there is no (2ε)competitive online algorithm for any positive constant ε.

