The minimum Steiner tree problem, a classical combinatorial optimization problem with a
long history, is a NP-complete problem. Due to its wide application, study of heuristic …

Steiner tree problem on the graph is an NP-Complete problem and has no exact solution in
polynomial time. Since this problem is practically useful, there are more attentions to …

Minimal Steiner tree problem on graphs is a traditional optimization problem, which has
wide-spread use in different application areas. Greedy heuristics for all the people to use the …

Given an undirected graph with weights associated with its edges, the Steiner tree problem
consists of finding a minimum weight subtree spanning a given subset of (terminal) nodes of …

The minimum Steiner tree problem, a classical combinatorial optimization problem with a
long history, is a NP-complete problem. Due to its wide application, study of heuristic …

In 2002, Lin and Xue [Inform. Process. Lett. 84 (2002) 103–107] introduced a variant of the
graph Steiner tree problem, in which each terminal vertex is required to be a leaf in the …

In this paper, we introduce a heuristic approximation algorithm for The Steiner Tree problem
which is known to be NP Hard. It is based on the concept of degree of each node in the …

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 …

The underlying models of many practical problems in various engineering fields are
equivalent to the Steiner tree problem in graphs, which is a typical NP-hard combinatorial …

This paper deals with a new heuristic for the Steiner tree problem (STP) in graphs which
aims for the efficient construction of approximate solutions in very large graphs. The …