Paper Abstract and Keywords |
Presentation |
2007-09-20 15:50
An Optimal Online Algorithm for the Graph Exploration Problem on Cycles Naoyuki Morimoto, Shuichi Miyazaki, Yasuo Okabe (Kyoto Univ.) COMP2007-39 |
Abstract |
(in Japanese) |
(See Japanese page) |
(in English) |
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$. It is known
that there is a 16-competitive online algorithm for planer graphs.
Recently, Asahiro et al. considered this problem on cycles and proved
that there is a 1.5-competitive online algorithm, while no online
algorithm can be $(1.25-\epsilon)$-competitive for any positive
constant $\epsilon$. In this paper, we give an optimal online
algorithm for this problem; namely, we give a $\frac{1+\sqrt{3}}{2}
(\simeq 1.366)$-competitive algorithm, and prove that there is no
$(\frac{1+\sqrt{3}}{2}-\epsilon)$-competitive algorithm for any
positive constant $\epsilon$. |
Keyword |
(in Japanese) |
(See Japanese page) |
(in English) |
Online algorithm / Competitive analysis / Graph exploration problem / / / / / |
Reference Info. |
IEICE Tech. Rep., vol. 107, no. 219, COMP2007-39, pp. 51-57, Sept. 2007. |
Paper # |
COMP2007-39 |
Date of Issue |
2007-09-13 (COMP) |
ISSN |
Print edition: ISSN 0913-5685 Online edition: ISSN 2432-6380 |
Copyright and reproduction |
All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034) |
Download PDF |
COMP2007-39 |
Conference Information |
Committee |
COMP |
Conference Date |
2007-09-20 - 2007-09-20 |
Place (in Japanese) |
(See Japanese page) |
Place (in English) |
|
Topics (in Japanese) |
(See Japanese page) |
Topics (in English) |
|
Paper Information |
Registration To |
COMP |
Conference Code |
2007-09-COMP |
Language |
Japanese |
Title (in Japanese) |
(See Japanese page) |
Sub Title (in Japanese) |
(See Japanese page) |
Title (in English) |
An Optimal Online Algorithm for the Graph Exploration Problem on Cycles |
Sub Title (in English) |
|
Keyword(1) |
Online algorithm |
Keyword(2) |
Competitive analysis |
Keyword(3) |
Graph exploration problem |
Keyword(4) |
|
Keyword(5) |
|
Keyword(6) |
|
Keyword(7) |
|
Keyword(8) |
|
1st Author's Name |
Naoyuki Morimoto |
1st Author's Affiliation |
Kyoto University (Kyoto Univ.) |
2nd Author's Name |
Shuichi Miyazaki |
2nd Author's Affiliation |
Kyoto University (Kyoto Univ.) |
3rd Author's Name |
Yasuo Okabe |
3rd Author's Affiliation |
Kyoto University (Kyoto Univ.) |
4th Author's Name |
|
4th Author's Affiliation |
() |
5th Author's Name |
|
5th Author's Affiliation |
() |
6th Author's Name |
|
6th Author's Affiliation |
() |
7th Author's Name |
|
7th Author's Affiliation |
() |
8th Author's Name |
|
8th Author's Affiliation |
() |
9th Author's Name |
|
9th Author's Affiliation |
() |
10th Author's Name |
|
10th Author's Affiliation |
() |
11th Author's Name |
|
11th Author's Affiliation |
() |
12th Author's Name |
|
12th Author's Affiliation |
() |
13th Author's Name |
|
13th Author's Affiliation |
() |
14th Author's Name |
|
14th Author's Affiliation |
() |
15th Author's Name |
|
15th Author's Affiliation |
() |
16th Author's Name |
|
16th Author's Affiliation |
() |
17th Author's Name |
|
17th Author's Affiliation |
() |
18th Author's Name |
|
18th Author's Affiliation |
() |
19th Author's Name |
|
19th Author's Affiliation |
() |
20th Author's Name |
|
20th Author's Affiliation |
() |
Speaker |
Author-1 |
Date Time |
2007-09-20 15:50:00 |
Presentation Time |
35 minutes |
Registration for |
COMP |
Paper # |
COMP2007-39 |
Volume (vol) |
vol.107 |
Number (no) |
no.219 |
Page |
pp.51-57 |
#Pages |
7 |
Date of Issue |
2007-09-13 (COMP) |
|