Abstract
Given an undirected weighted graph G = (V,E,c) and a set T, where V is the set of nodes, E is the set of edges, c is a cost function, and T is a subset of nodes called terminals, the Steiner tree problem in graphs is that of finding the subgraph of the minimum weight that connects all of terminals.
The Steiner tree problem is an example of an NP-complete combinatorial optimization problem [1]. Thus, approximate methods are usually employed for constructing the Steiner tree. In this study, the KMB algorithm [2], which is an efficient construction method for Steiner tree problems, is enhanced by considering edge betweenness [3]. The results of numerical simulations indicate that our improved KMB algorithm shows good performances for various types of benchmark Steiner tree problems.
