| Presentation | 2016-09-06 An algorithm for an optimal sink location problem in dynamic tree networks on condition that minimize the total evacuation time Naoki Takahashi, Naoki Katoh, Yuya Higashikawa, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | We study dynamic tree network to represent evacuation of evacuees originally at vertices by using a road network to a safety place called a sink. In dynamic tree $T=(V,E)$, a supply (a number of evacuees) is associated with each vertex $vin V$, each edge $ein E$ is associated with a transit time and a capacity $c$. The capacity limits the maximum number of evacuees that can enter $e$ per unit time We assume $c$ takes the same value for all edges. In addition, one vertex $v$ is designated as a sink $s$ which represents a safety place to which all evacuees evacuate to. The problem is to find an optimal location of a sink that minimized the sum of evacuation time for all evacuees. We propose an $O(n^2)$ time an $O(n^2)$ space algorithm to find an optimal sink location. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | Dynamic tree network / Dynamic path network / cluster / minimization of total evacuation time |
| Paper # | COMP2016-20 |
| Date of Issue | 2016-08-30 (COMP) |
| Conference Information | |
| Committee | COMP |
|---|---|
| Conference Date | 2016/9/6(1days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | Toyama Prefectural University |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Chair | Hiroo Itoh(Univ. of Electro-Comm.) |
| Vice Chair | Yuushi Uno(Osaka Pref. Univ.) |
| Secretary | Yuushi Uno(Seikei Univ.) |
| Assistant | |
| 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) | An algorithm for an optimal sink location problem in dynamic tree networks on condition that minimize the total evacuation time |
| Sub Title (in English) | |
| Keyword(1) | Dynamic tree network |
| Keyword(2) | Dynamic path network |
| Keyword(3) | cluster |
| Keyword(4) | minimization of total evacuation time |
| 1st Author's Name | Naoki Takahashi |
| 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 | Yuya Higashikawa |
| 3rd Author's Affiliation | Chuo University(Chuo Univ) |
| Date | 2016-09-06 |
| Paper # | COMP2016-20 |
| Volume (vol) | vol.116 |
| Number (no) | COMP-211 |
| Page | pp.pp.37-44(COMP), |
| #Pages | 8 |
| Date of Issue | 2016-08-30 (COMP) |