| IEICE Technical Committee Submission System Conference Paper's Information |
Online Proceedings [Sign in] Tech. Rep. Archives |
| Go Top Page | Go Previous | [Japanese] / [English] |
| Paper Abstract and Keywords | ||
| Presentation | 2010-01-25 09:30 Competitive Analysis of the k-Canadian Traveller Problem for Graphs with Restricted Edge Weights Takeshi Fukuda, Shuichi Miyazaki, Yasuo Okabe (Kyoto Univ.)  COMP2009-39 |
|
| Abstract | (in Japanese) | (See Japanese page) |
| (in English) | The $k$-Canadian Traveller Problem ($k$-CTP) is one of the online problems. In this problem, we are given an undirected edge-weighted graph $G=(V,E)$, a source vertex $s$, and a destination vertex $t$, and our purpose is to traverse $G$ from $s$ to $t$. An online algorithm knows the topology of $G$ and the weight of each edge in advance. However, at most $k$ edges of $G$ are blocked and the algorithm cannot go through these edges. Initially, the algorithm does not know which edges are blocked; when it reaches either endpoint of a blocked edge, it first learns that this edge is blocked. For this problem, Westphal gave a deterministic (2$k$+1)-competitive algorithm, and proved that there is no better algorithm. In this paper, we restrict the graph class to obtain a better competitive ratio. Specifically, we consider the case that (i) edge weights are uniform (i.e., all the weights are 1), and (ii) edge weights satisfy the triangle inequality, on complete graphs. (We also assume that $k≦|V|-2$ in order to guarantee the connectivity of the input graphs.) In both cases, we give optimal online algorithms whose competitive ratios are ($k$+1)/2 and $k$, respectively. |
|
| Keyword | (in Japanese) | (See Japanese page) |
| (in English) | online algorithm / competitive analysis / the shortest path problem / / / / / | |
| Reference Info. | IEICE Tech. Rep., vol. 109, no. 391, COMP2009-39, pp. 1-8, Jan. 2010. | |
| Paper # | COMP2009-39 | |
| Date of Issue | 2010-01-18 (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 | COMP2009-39 |
|
| Conference Information | |
| Committee | COMP |
| Conference Date | 2010-01-25 - 2010-01-25 |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | Nishijin Plaza, Kyushu University |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Paper Information | |
| Registration To | COMP |
| Conference Code | 2010-01-COMP |
| Language | Japanese |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | Competitive Analysis of the k-Canadian Traveller Problem for Graphs with Restricted Edge Weights |
| Sub Title (in English) | |
| Keyword(1) | online algorithm |
| Keyword(2) | competitive analysis |
| Keyword(3) | the shortest path problem |
| Keyword(4) | |
| Keyword(5) | |
| Keyword(6) | |
| Keyword(7) | |
| Keyword(8) | |
| 1st Author's Name | Takeshi Fukuda |
| 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 | () |
| Speaker | Author-1 |
| Date Time | 2010-01-25 09:30:00 |
| Presentation Time | 35 minutes |
| Registration for | COMP |
| Paper # | COMP2009-39 |
| Volume (vol) | vol.109 |
| Number (no) | no.391 |
| Page | pp.1-8 |
| #Pages | 8 |
| Date of Issue | 2010-01-18 (COMP) |
[Return to Top Page]