Downloads: 135

Files in This Item:
File Description SizeFormat 
transinf.E92.D.1620.pdf338.73 kBAdobe PDFView/Open
Title: The Online Graph Exploration Problem on Restricted Graphs
Authors: MIYAZAKI, Shuichi  kyouindb  KAKEN_id  orcid https://orcid.org/0000-0003-0369-1970 (unconfirmed)
MORIMOTO, Naoyuki  kyouindb  KAKEN_id
OKABE, Yasuo  kyouindb  KAKEN_id  orcid https://orcid.org/0000-0003-0825-2256 (unconfirmed)
Author's alias: 宮崎, 修一
森本, 尚之
岡部, 寿男
Miyazaki, Shuichi
Morimoto, Naoyuki
Okabe, Yasuo
Keywords: the graph exploration problem
online algorithm
competitive analysis
Issue Date: 1-Sep-2009
Publisher: Institute of Electronics, Information and Communications Engineers (IEICE)
Journal title: IEICE Transactions on Information and Systems
Volume: E92-D
Issue: 9
Start page: 1620
End page: 1627
Abstract: 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 ν, then it learns information on nodes and edges adjacent to ν. 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 depth-first search always returns an optimal tour. However, if graphs have cycles, the problem is non-trivial. 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.5-competitive 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 $frac{1+sqrt{3}}{2}(simeq1.366)$-competitive algorithm, and prove that there is no $(frac{1+sqrt{3}}{2}-epsilon)$-competitive algorithm for any positive constant ε. Furthermore, we consider the problem on unweighted graphs. We also give an optimal result; namely we give a 2-competitive algorithm and prove that there is no (2-ε)-competitive online algorithm for any positive constant ε.
Rights: © 2009 The Institute of Electronics, Information and Communication Engineers
URI: http://hdl.handle.net/2433/226939
DOI(Published Version): 10.1587/transinf.E92.D.1620
Appears in Collections:Journal Articles

Show full item record

Export to RefWorks


Export Format: 


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.