Paper Abstract and Keywords |
Presentation |
2013-09-03 10:10
An O(n log n) Algorithm for the Minimax Regret Sink Location Problem in Dynamic Path Networks with the Uniform Capacity Yuya Higashikawa (Kyoto Univ.), Mordecai J. Golin (HKUST), Naoki Katoh (Kyoto Univ.) COMP2013-25 |
Abstract |
(in Japanese) |
(See Japanese page) |
(in English) |
This paper considers minimax regret 1-sink location problems in {it dynamic path networks}.
In our model, a dynamic path network consists of an undirected path with positive edge lengths and uniform edge capacity, and the vertex supply which is nonnegative value is unknown but only the interval of supply is known. A particular assignment of supply to each vertex is called a {it scenario}. Under any scenario, the cost of a sink location is defined as the minimum time to complete evacuation for all supplies (evacuees), and the {it regret} of a sink location $x$ is defined as the cost of $x$ minus the cost of the optimal sink location. Then, the problem is to find a point as a sink such that the maximum regret for all possible scenarios is minimized. We present an $O(n log n)$ time algorithm for minimax regret 1-sink location problems in dynamic path networks with uniform capacity, where $n$ is the number of vertices in the network. This improves upon the existing time bound of $O(n log^2 n)$ by [6]. |
Keyword |
(in Japanese) |
(See Japanese page) |
(in English) |
minimax regret / sink location / dynamic flow / evacuation planning / / / / |
Reference Info. |
IEICE Tech. Rep., vol. 113, no. 198, COMP2013-25, pp. 1-8, Sept. 2013. |
Paper # |
COMP2013-25 |
Date of Issue |
2013-08-27 (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 |
COMP2013-25 |
Conference Information |
Committee |
COMP |
Conference Date |
2013-09-03 - 2013-09-03 |
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 |
2013-09-COMP |
Language |
English |
Title (in Japanese) |
(See Japanese page) |
Sub Title (in Japanese) |
(See Japanese page) |
Title (in English) |
An O(n log n) Algorithm for the Minimax Regret Sink Location Problem in Dynamic Path Networks with the Uniform Capacity |
Sub Title (in English) |
|
Keyword(1) |
minimax regret |
Keyword(2) |
sink location |
Keyword(3) |
dynamic flow |
Keyword(4) |
evacuation planning |
Keyword(5) |
|
Keyword(6) |
|
Keyword(7) |
|
Keyword(8) |
|
1st Author's Name |
Yuya Higashikawa |
1st Author's Affiliation |
Kyoto University (Kyoto Univ.) |
2nd Author's Name |
Mordecai J. Golin |
2nd Author's Affiliation |
The Hong Kong University of Science and Technology (HKUST) |
3rd Author's Name |
Naoki Katoh |
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 |
2013-09-03 10:10:00 |
Presentation Time |
35 minutes |
Registration for |
COMP |
Paper # |
COMP2013-25 |
Volume (vol) |
vol.113 |
Number (no) |
no.198 |
Page |
pp.1-8 |
#Pages |
8 |
Date of Issue |
2013-08-27 (COMP) |
|