| IEICE Technical Committee Submission System Conference Paper's Information |
Online Proceedings [Sign in] Tech. Rep. Archives |
| Go Top Page | Go Previous | [Japanese] / [English] |
| Paper Abstract and Keywords | ||
| Presentation | 2019-05-10 16:25 A Shortest Path Heuristic Using Network Centralities Misa Fujita (TUS), Takayuki Kimura (NIT), Tohru Ikeguchi (TUS)  NLP2019-8 |
|
| Abstract | (in Japanese) | (See Japanese page) |
| (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) |
| (in English) | Network centralities / Complex networks / the Steiner tree problem in graphs / Combinatorial optimization / / / / | |
| Reference Info. | IEICE Tech. Rep., vol. 119, no. 19, NLP2019-8, pp. 41-46, May 2019. | |
| Paper # | NLP2019-8 | |
| Date of Issue | 2019-05-03 (NLP) | |
| 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 | NLP2019-8 |
|
| Conference Information | |
| Committee | NLP |
| Conference Date | 2019-05-10 - 2019-05-11 |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | J:COM HoltoHALL OITA |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | etc. |
| Paper Information | |
| Registration To | NLP |
| Conference Code | 2019-05-NLP |
| Language | Japanese |
| 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 |
| Keyword(5) | |
| Keyword(6) | |
| Keyword(7) | |
| Keyword(8) | |
| 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) |
| 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 | () |
| Speaker | Author-1 |
| Date Time | 2019-05-10 16:25:00 |
| Presentation Time | 25 minutes |
| Registration for | NLP |
| Paper # | NLP2019-8 |
| Volume (vol) | vol.119 |
| Number (no) | no.19 |
| Page | pp.41-46 |
| #Pages | 6 |
| Date of Issue | 2019-05-03 (NLP) |
[Return to Top Page]