Information: Join today and make your research activities more affordable! Technical workshop participation fees and annual registration fees are available at member rates.
Notice: [Important] Announcement of Changes to Registration Fee Payment and Manuscript Upload Procedures for IEICE Technical Meetings
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 2022-12-06 15:00
A Fast (1+epsilon)-Approximating Algorithm for Single Source Replacement Path Problem
Kaito Harada, Naoki Kitamura, Taisuke Izumi, Toshimitsu masuzawa (Osaka Univ.) COMP2022-28
Abstract (in Japanese) (See Japanese page) 
(in English) Let $G$ be any weighted undirected graph of $n$ vertices and $m$ edges, and $s$ be an arbitrary source vertex in $G$. In this paper, we present a faster algorithm of building
the $(1 + epsilon)$-approximate oracle for the single-source replacement path problem which computes the $s$-$t$ shortest path in $G -e$ for all pairs of edges $e$ and vertices $t$ in $G$. Where $epsilon$ is an any positive constant. The construction time of our algorithm is $tilde{O}(m)$, and the query processing time is $tilde{O}(1)$.
Keyword (in Japanese) (See Japanese page) 
(in English) single source replacement path problem / distance sensitivity oracle / / / / / /  
Reference Info. IEICE Tech. Rep., vol. 122, no. 294, COMP2022-28, pp. 32-39, Dec. 2022.
Paper # COMP2022-28 
Date of Issue 2022-11-29 (COMP) 
ISSN 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 COMP2022-28

Conference Information
Committee COMP  
Conference Date 2022-12-06 - 2022-12-06 
Place (in Japanese) (See Japanese page) 
Place (in English) Ehime Univ. Media Hall 
Topics (in Japanese) (See Japanese page) 
Topics (in English) Theoretical Computer Science, etc 
Paper Information
Registration To COMP 
Conference Code 2022-12-COMP 
Language Japanese 
Title (in Japanese) (See Japanese page) 
Sub Title (in Japanese) (See Japanese page) 
Title (in English) A Fast (1+epsilon)-Approximating Algorithm for Single Source Replacement Path Problem 
Sub Title (in English)  
Keyword(1) single source replacement path problem  
Keyword(2) distance sensitivity oracle  
Keyword(3)  
Keyword(4)  
Keyword(5)  
Keyword(6)  
Keyword(7)  
Keyword(8)  
1st Author's Name Kaito Harada  
1st Author's Affiliation Osaka University (Osaka Univ.)
2nd Author's Name Naoki Kitamura  
2nd Author's Affiliation Osaka University (Osaka Univ.)
3rd Author's Name Taisuke Izumi  
3rd Author's Affiliation Osaka University (Osaka Univ.)
4th Author's Name Toshimitsu masuzawa  
4th Author's Affiliation Osaka University (Osaka Univ.)
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 ()
21st Author's Name  
21st Author's Affiliation ()
22nd Author's Name  
22nd Author's Affiliation ()
23rd Author's Name  
23rd Author's Affiliation ()
24th Author's Name  
24th Author's Affiliation ()
25th Author's Name  
25th Author's Affiliation ()
26th Author's Name / /
26th Author's Affiliation ()
()
27th Author's Name / /
27th Author's Affiliation ()
()
28th Author's Name / /
28th Author's Affiliation ()
()
29th Author's Name / /
29th Author's Affiliation ()
()
30th Author's Name / /
30th Author's Affiliation ()
()
31st Author's Name / /
31st Author's Affiliation ()
()
32nd Author's Name / /
32nd Author's Affiliation ()
()
33rd Author's Name / /
33rd Author's Affiliation ()
()
34th Author's Name / /
34th Author's Affiliation ()
()
35th Author's Name / /
35th Author's Affiliation ()
()
36th Author's Name / /
36th Author's Affiliation ()
()
Speaker Author-1 
Date Time 2022-12-06 15:00:00 
Presentation Time 25 minutes 
Registration for COMP 
Paper # COMP2022-28 
Volume (vol) vol.122 
Number (no) no.294 
Page pp.32-39 
#Pages 8 
Date of Issue 2022-11-29 (COMP) 

[Return to Top Page]

[Return to IEICE Web Page]
The Institute of Electronics, Information and Communication Engineers (IEICE), Japan