A heuristic method for solving the Steiner tree problem in graphs using network centralities

被引：0

作者：

Fujita, Misa ^{[1
,2
]}

Shimada, Yutaka ^{[3
]}

Kimura, Takayuki ^{[4
]}

Ikeguchi, Tohru ^{[2
,5
]}

机构：

[1] Chukyo Univ, Sch Engn, Dept Elect & Elect Engn, Nagoya, Aichi, Japan

[2] Tokyo Univ Sci, Grad Sch Engn, Dept Management Sci, Katsushika Ku, Tokyo, Japan

[3] Saitama Univ, Grad Sch Sci & Engn, Sakura Ku, Saitama, Japan

[4] Nippon Inst Technol, Fac Fundamental Engn, Dept Elect Elect & Commun Engn, Miyashiro, Saitama, Japan

[5] Tokyo Univ Sci, Fac Engn, Dept Informat & Comp Technol, Katsushika Ku, Tokyo, Japan

来源：

PLOS ONE | 2024年 / 19卷 / 06期

基金：

日本学术振兴会;

关键词：

ALGORITHM; SEARCH;

D O I：

10.1371/journal.pone.0303764

中图分类号：

O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];

学科分类号：

07 ; 0710 ; 09 ;

摘要：

We propose a heuristic method of using network centralities for constructing small-weight Steiner trees in this paper. The Steiner tree problem in graphs is one of the practical NP-hard combinatorial optimization problems. Given a graph and a set of vertices called terminals in the graph, the objective of the Steiner tree problem in graphs is to find a minimum weight Steiner tree that is a tree containing all the terminals. Conventional construction methods make a Steiner tree based on the shortest paths between terminals. If these shortest paths are overlapped as much as possible, we can obtain a small-weight Steiner tree. Therefore, we proposed to use network centralities to distinguish which edges should be included to make a small-weight Steiner tree. Experimental results revealed that using the vertex or the edge betweenness centralities contributes to making small-weight Steiner trees.

引用

页数：16

共 50 条

[1] A Solution Merging Heuristic for the Steiner Problem in Graphs Using Tree Decompositions
Bosman, Thomas
EXPERIMENTAL ALGORITHMS, SEA 2015, 2015, 9125 : 391 - 402
[2] Solving the Steiner tree problem in graphs by chaotic search
Fujita, Misa
Kimura, Takayuki
Ikeguchi, Tohru
IEICE NONLINEAR THEORY AND ITS APPLICATIONS, 2020, 11 (01): : 90 - 108
[3] Parallel Minimum Spanning Tree Heuristic for the Steiner problem in graphs
Akbari, Hoda
Iramnanesh, Zeinab
Ghodsi, Mohammad
2007 INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED SYSTEMS, VOLS 1 AND 2, 2007, : 443 - 450
[4] Cherrypick: Solving the Steiner Tree Problem in Graphs using Deep Reinforcement Learning
Yan, Zong
Du, Haizhou
Zhang, Jiahao
Li, Guoqing
PROCEEDINGS OF THE 2021 IEEE 16TH CONFERENCE ON INDUSTRIAL ELECTRONICS AND APPLICATIONS (ICIEA 2021), 2021, : 35 - 40
[5] A Steiner point candidate-based heuristic framework for the Steiner tree problem in graphs
Zhang, Hao
Ye, Dong-Yi
Guo, Wen-Zhong
JOURNAL OF ALGORITHMS & COMPUTATIONAL TECHNOLOGY, 2016, 10 (02) : 99 - 114
[6] A Partition-Based Heuristic for the Steiner Tree Problem in Large Graphs
Leitner, Markus
Ljubic, Ivana
Luipersbeck, Martin
Resch, Max
HYBRID METAHEURISTICS, HM 2014, 2014, 8457 : 56 - 70
[7] STEINER PROBLEM IN GRAPHS - HEURISTIC METHODS
VOSS, S
DISCRETE APPLIED MATHEMATICS, 1992, 40 (01) : 45 - 72
[8] The pilot method: A strategy for heuristic repetition with application to the Steiner problem in graphs
Duin, G
Voss, S
NETWORKS, 1999, 34 (03) : 181 - 191
[9] Fuzzy Shortest Paths Approximation for Solving the Fuzzy Steiner Tree Problem in Graphs
Seda, Milos
PROCEEDINGS OF WORLD ACADEMY OF SCIENCE, ENGINEERING AND TECHNOLOGY, VOL 14, 2006, 14 : 22 - 26
[10] Solving Steiner tree problems in graphs to optimality
Koch, T
Martin, A
NETWORKS, 1998, 32 (03) : 207 - 232

← 1 2 3 4 5 →