| Presentation | 2019-05-10 A Shortest Path Heuristic Using Network Centralities Misa Fujita, Takayuki Kimura, Tohru Ikeguchi, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | A distance network heuristic and a shortest path heuristic are one of the popular construction methods for solving the Steiner tree problem in graphs. We have already reported that including edges or vertices which have high network centralities, such as the edge betweenness centrality, the vertex closeness centrality, and the vertex betweenness centrality, shows good performance for constructing a small-cost Steiner tree by the distance network heuristic. In this study, we investigate whether including vertices which have high network centralities shows good performance for constructing small-cost Steiner trees by the shortest path heuristic. From the results of numerical experiments, the shortest path heuristic using network centralities shows better performance than the original shortest path heuristic.In particular, the shortest path heuristic using vertex betweenness centrality improves the gaps from the optimum solution about 3% against the original shortest path heuristic. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | Network centralities / Complex networks / the Steiner tree problem in graphs / Combinatorial optimization |
| Paper # | NLP2019-8 |
| Date of Issue | 2019-05-03 (NLP) |
| Conference Information | |
| Committee | NLP |
|---|---|
| Conference Date | 2019/5/10(2days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | J:COM HoltoHALL OITA |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | etc. |
| Chair | Norikazu Takahashi(Okayama Univ.) |
| Vice Chair | Hiroaki Kurokawa(Tokyo Univ. of Tech.) |
| Secretary | Hiroaki Kurokawa(Hiroshima Inst. of Tech.) |
| Assistant | Masayuki Kimura(Kyoto Univ.) / Yutaka Shimada(Saitama Univ.) |
| Paper Information | |
| Registration To | Technical Committee on Nonlinear Problems |
|---|---|
| Language | JPN |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | A Shortest Path Heuristic Using Network Centralities |
| Sub Title (in English) | |
| Keyword(1) | Network centralities |
| Keyword(2) | Complex networks |
| Keyword(3) | the Steiner tree problem in graphs |
| Keyword(4) | Combinatorial optimization |
| 1st Author's Name | Misa Fujita |
| 1st Author's Affiliation | Tokyo University of Science(TUS) |
| 2nd Author's Name | Takayuki Kimura |
| 2nd Author's Affiliation | Nippon Institute of Technology(NIT) |
| 3rd Author's Name | Tohru Ikeguchi |
| 3rd Author's Affiliation | Tokyo University of Science(TUS) |
| Date | 2019-05-10 |
| Paper # | NLP2019-8 |
| Volume (vol) | vol.119 |
| Number (no) | NLP-19 |
| Page | pp.pp.41-46(NLP), |
| #Pages | 6 |
| Date of Issue | 2019-05-03 (NLP) |