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 2020-03-01 14:50
Minmax regret 1-sink problem with parametric weights
Yuki Tokuni (Kwansei Gakuin Univ.), Noaki Katoh, Junichi Teruyama, Yuya Higashikawa, Tetsuya Fujie (Univ. of Hyogo) COMP2019-51
Abstract (in Japanese) (See Japanese page) 
(in English) This paper addresses the minmax regret 1-sink problem in dynamic path networks with parametric weights. A dynamic path network consists of an undirected path with positive edge lengths and edge capacities, and vertex weights given as positive functions in one parameter. For a sink location $x$ and a parameter value $t$, the location cost of $x$ under $t$ is defined as the sum of evacuation time to $x$ for all the evacuees under $t$. The regret of $x$ under $t$ is defined as the difference of the location cost of $x$ under $t$ from the optimal location cost under $t$. Our aim is to find a sink location $x^{*}$ which minimizes the maximum regret of $x$ over any possible $t$. In this paper, we present the first polynomial time algorithm for the problem.
Keyword (in Japanese) (See Japanese page) 
(in English) minimax regret / facility location problem / polynomial time algorithm / / / / /  
Reference Info. IEICE Tech. Rep., vol. 119, no. 433, COMP2019-51, pp. 35-41, March 2020.
Paper # COMP2019-51 
Date of Issue 2020-02-23 (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 COMP2019-51

Conference Information
Committee COMP  
Conference Date 2020-03-01 - 2020-03-01 
Place (in Japanese) (See Japanese page) 
Place (in English) The University of Electro-Communications 
Topics (in Japanese) (See Japanese page) 
Topics (in English)  
Paper Information
Registration To COMP 
Conference Code 2020-03-COMP 
Language Japanese 
Title (in Japanese) (See Japanese page) 
Sub Title (in Japanese) (See Japanese page) 
Title (in English) Minmax regret 1-sink problem with parametric weights 
Sub Title (in English)  
Keyword(1) minimax regret  
Keyword(2) facility location problem  
Keyword(3) polynomial time algorithm  
Keyword(4)  
Keyword(5)  
Keyword(6)  
Keyword(7)  
Keyword(8)  
1st Author's Name Yuki Tokuni  
1st Author's Affiliation Kwansei Gakuin University (Kwansei Gakuin Univ.)
2nd Author's Name Noaki Katoh  
2nd Author's Affiliation University of Hyogo (Univ. of Hyogo)
3rd Author's Name Junichi Teruyama  
3rd Author's Affiliation University of Hyogo (Univ. of Hyogo)
4th Author's Name Yuya Higashikawa  
4th Author's Affiliation University of Hyogo (Univ. of Hyogo)
5th Author's Name Tetsuya Fujie  
5th Author's Affiliation University of Hyogo (Univ. of Hyogo)
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-3 
Date Time 2020-03-01 14:50:00 
Presentation Time 25 minutes 
Registration for COMP 
Paper # COMP2019-51 
Volume (vol) vol.119 
Number (no) no.433 
Page pp.35-41 
#Pages 7 
Date of Issue 2020-02-23 (COMP) 

[Return to Top Page]

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