| Presentation | 2020-03-01 Minmax regret 1-sink problem with parametric weights Yuki Tokuni, Noaki Katoh, Junichi Teruyama, Yuya Higashikawa, Tetsuya Fujie, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(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) |
| Keyword(in English) | minimax regret / facility location problem / polynomial time algorithm |
| Paper # | COMP2019-51 |
| Date of Issue | 2020-02-23 (COMP) |
| Conference Information | |
| Committee | COMP |
|---|---|
| Conference Date | 2020/3/1(1days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | The University of Electro-Communications |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Chair | Toshihiro Fujito(Toyohashi Univ. of Tech.) |
| Vice Chair | Shinichi Nakano(Gunma Univ.) |
| Secretary | Shinichi Nakano(Kumamoto Univ) |
| Assistant | Kazuhisa Seto(Seikei Univ.) |
| Paper Information | |
| Registration To | Technical Committee on Theoretical Foundations of Computing |
|---|---|
| Language | JPN |
| 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 |
| 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) |
| Date | 2020-03-01 |
| Paper # | COMP2019-51 |
| Volume (vol) | vol.119 |
| Number (no) | COMP-433 |
| Page | pp.pp.35-41(COMP), |
| #Pages | 7 |
| Date of Issue | 2020-02-23 (COMP) |