This paper presents the first investigation on applying a particle swarm optimization (PSO)
algorithm to both the Steiner tree problem and the delay constrained multicast routing …

The Steiner tree problem is a well-known problem in network design, routing, and VLSI
design. Given a graph, edge costs, and a set of dedicated vertices (terminals), the Steiner …

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 …

Hybrid approaches are often recommended for dealing in an efficient manner with complex
problems that require considerable computational time. In this study, we follow a similar …

In a complex network application, a set of nodes might be partitioned into multiple local
clusters with different functions, properties, or communication protocols, and the …

The Steiner Tree problem in graphs is an NP-hard problem having applications in many
areas including telecommunication, distribution and transportation systems. We survey …

Given a set of input points, the Steiner Tree Problem (STP) is to find a minimum-length tree
that connects the input points, where it is possible to add new points to minimize the length …

The Steiner tree problem in graphs (STP) is a fundamental NP-hard combinatorial
optimization problem of theoretical and practical interest. Common applications range from …

In this paper, we present an improved algorithm based on the Physarum polycephalum
model (PPM) to solve Steiner tree problem (STP). We use the improved method to calculate …