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 条

[21] Solving Steiner Tree Problems in Graphs with Lagrangian Relaxation
Laura Bahiense
Francisco Barahona
Oscar Porto
Journal of Combinatorial Optimization, 2003, 7 : 259 - 282
[22] Homogeneously orderable graphs and the Steiner tree problem
Brandstadt, A
Dragan, FF
Nicolai, F
GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 1995, 1017 : 381 - 395
[23] The Steiner tree problem on graphs: Inapproximability results
Chlebik, Miroslav
Chlebikova, Janka
THEORETICAL COMPUTER SCIENCE, 2008, 406 (03) : 207 - 214
[24] Approximation hardness of the Steiner tree problem on graphs
Chlebík, M
Chlebíkov, J
ALGORITHM THEORY - SWAT 2002, 2002, 2368 : 170 - 179
[25] An ant algorithm for the Steiner Tree Problem in graphs
Luyet, Luc
Varone, Sacha
Zufferey, Nicolas
APPLICATIONS OF EVOLUTIONARY COMPUTING, PROCEEDINGS, 2007, 4448 : 42 - +
[26] An improved EDA for solving Steiner tree problem
Liu, Lei
Wang, Hua
Kong, Guohong
CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2015, 27 (13): : 3483 - 3496
[27] Solving the Steiner Tree Problem with few Terminals
Fichte, Johannes K.
Hecher, Markus
Schidler, Andre
2020 IEEE 32ND INTERNATIONAL CONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE (ICTAI), 2020, : 293 - 300
[28] A new heuristic for the Euclidean Steiner Tree Problem in Rn
Pinto, Renan Vicente
Maculan, Nelson
TOP, 2023, 31 (02) : 391 - 413
[29] A Heuristic Algorithm for the Prize Collecting Steiner Tree Problem
Hosokawa, Y.
Chiba, E.
2014 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT (IEEM), 2014, : 99 - 102
[30] On a Relative MaxSAT Encoding for the Steiner Tree Problem in Graphs
de Oliveira, Ricardo Tavares
Silva, Fabiano
ADVANCES IN ARTIFICIAL INTELLIGENCE AND ITS APPLICATIONS, MICAI 2015, PT II, 2015, 9414 : 422 - 434

← 1 2 3 4 5 →