Future paths for integer programming and links to artificial intelligence
Computers and Operations Research - Special issue: Applications of integer programming
The steiner problem with edge lengths 1 and 2,
Information Processing Letters
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
On better heuristic for euclidean Steiner minimum trees (extended abstract)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Improved approximations for the Steiner tree problem
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Steiner's problem in graphs: heuristic methods
Discrete Applied Mathematics - Special issue: combinatorial methods in VLSI
Multicast routing for multimedia communication
IEEE/ACM Transactions on Networking (TON)
A note on the prize collecting traveling salesman problem
Mathematical Programming: Series A and B
On the Steiner ratio in 3-space
Journal of Combinatorial Theory Series A
Distributed algorithms for multicast path setup in data networks
IEEE/ACM Transactions on Networking (TON)
Disproofs of generalized Gilbert-Pollak conjecture on the Steiner ratio in three or more dimensions
Journal of Combinatorial Theory Series A
Approximating geometrical graphs via “spanners” and “banyans”
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
The grid: blueprint for a new computing infrastructure
The grid: blueprint for a new computing infrastructure
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
Journal of the ACM (JACM)
A 1.598 approximation algorithm for the Steiner problem in graphs
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
SAC '97 Proceedings of the 1997 ACM symposium on Applied computing
Improved Steiner tree approximation in graphs
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
A note on the generalized Steiner tree polytope
Discrete Applied Mathematics
A new approximation algorithm for the Steiner tree problem with performance ratio 5/3
Journal of Algorithms
A Distributed Algorithm for Minimum-Weight Spanning Trees
ACM Transactions on Programming Languages and Systems (TOPLAS)
A polylogarithmic approximation algorithm for the group Steiner tree problem
Journal of Algorithms
Approximation algorithms
A note on distributed multicast routing in point-to-point networks
Computers and Operations Research
Introduction to Algorithms
A Parallel Grasp for the Steiner Tree Problem in Graphs Using a Hybrid Local Search Strategy
Journal of Global Optimization
A Parallel GRASP for the Steiner Problem in Graphs
IRREGULAR '98 Proceedings of the 5th International Symposium on Solving Irregularly Structured Problems in Parallel
Phylogenetic k-Root and Steiner k-Root
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
The Euclidean Bottleneck Steiner Tree and Steiner Tree with Minimum Number of Steiner Points
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
The Full Steiner Tree Problem in Phylogeny
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
On the approximability of the Steiner tree problem
Theoretical Computer Science - Mathematical foundations of computer science
Constructing exact octagonal steiner minimal trees
Proceedings of the 13th ACM Great Lakes symposium on VLSI
Better approximation bounds for the network and Euclidean Steiner tree problems
Better approximation bounds for the network and Euclidean Steiner tree problems
The handbook of ad hoc wireless networks
The handbook of ad hoc wireless networks
ISQED '05 Proceedings of the 6th International Symposium on Quality of Electronic Design
A survey of combinatorial optimization problems in multicast routing
Computers and Operations Research
On network design problems: fixed cost flows and the covering steiner problem
ACM Transactions on Algorithms (TALG)
Parallelization of local search for Euclidean Steiner tree problem
Proceedings of the 44th annual Southeast regional conference
Dynamic multicast routing algorithm for delay and delay variation-bounded Steiner tree problem
Knowledge-Based Systems
Parallel Computing - Optimization on grids - Optimization for grids
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Parallel Minimum Spanning Tree Heuristic for the steiner problem in graphs
ICPADS '07 Proceedings of the 13th International Conference on Parallel and Distributed Systems - Volume 01
Parallel Algorithms for Steiner Tree Problem
ICCIT '08 Proceedings of the 2008 Third International Conference on Convergence and Hybrid Information Technology - Volume 01
A distributed dual ascent algorithm for Steiner problems in multicast routing
Networks - Special Issue on Trees
An O(n log n) approximation scheme for Steiner tree in planar graphs
ACM Transactions on Algorithms (TALG)
Steiner Tree Problems In Computer Communication Networks
Steiner Tree Problems In Computer Communication Networks
Wireless Personal Communications: An International Journal
Mathematical Aspects of Network Routing Optimization
Mathematical Aspects of Network Routing Optimization
Probability-based approach to rectilinear Steiner tree problems
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
A Procedure for Placement of Standard-Cell VLSI Circuits
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Efficient Steiner tree construction based on spanning graphs
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
A Distributed Heuristic Algorithm for the Rectilinear Steiner Minimal Tree Problem
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
| Hi-index | 0.00 |
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 of the tree. Solving the STP is of great importance since it is one of the fundamental problems in network design, very large scale integration routing, multicast routing, wire length estimation, computational biology, and many other areas. However, the STP is NP-hard, which shatters any hopes of finding a polynomial-time algorithm to solve the problem exactly. This is why the majority of research has looked at finding efficient heuristic algorithms. Additionally, many authors focused their work on utilizing the ever-increasing computational power and developed many parallel and distributed methods for solving the problem. In this way we are able to obtain better results in less time than ever before. Here, we present a survey of the parallel and distributed methods for solving the STP and discuss some of their applications.