| Presentation | 2018-09-18 Minimax regret 1-center problems with parametric weights Shohei Ookatsu, Naoki Katoh, Junichi Teruyama, Yuya Higashikawa, Hiroyoshi Miwa, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | In this paper, based on the minimax regret model which is an approach for the robust optimization, we consider 1-center problems in weighted and undirected graphs. In an input graph, the weight of a vertex is given as a positive function in time and the length of an edge is given as a positive value. At time t, the weighted distance of v w.r.t. x is defined as the product of the shortest distance from v to x and the weight of v, and the location cost of x is defined as the maximum weighted distance w.r.t. x. The regret of x at time t is defined as the value subtracted the optimal location cost at t from the location cost of x at t. Our aim is to find the location which minimizes the maximum regret over time. We present polynomial time algorithms for the problems on paths and trees. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | minimax regret / facility location problem / polynomial time algorithm |
| Paper # | COMP2018-13 |
| Date of Issue | 2018-09-11 (COMP) |
| Conference Information | |
| Committee | COMP |
|---|---|
| Conference Date | 2018/9/18(1days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | Kyusyu Institute of Technology |
| 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(Kyoto 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) | Minimax regret 1-center problems 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 | Shohei Ookatsu |
| 1st Author's Affiliation | Kwansei Gakuin University(Kwansei Gakuin Univ.) |
| 2nd Author's Name | Naoki Katoh |
| 2nd Author's Affiliation | Kwansei Gakuin University(Kwansei Gakuin Univ.) |
| 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 | Hiroyoshi Miwa |
| 5th Author's Affiliation | Kwansei Gakuin University(Kwansei Gakuin Univ.) |
| Date | 2018-09-18 |
| Paper # | COMP2018-13 |
| Volume (vol) | vol.118 |
| Number (no) | COMP-216 |
| Page | pp.pp.29-33(COMP), |
| #Pages | 5 |
| Date of Issue | 2018-09-11 (COMP) |