A Survey of Parallel and Distributed Algorithms for the Steiner Tree Problem

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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:International journal of parallel programming Jg. 42; H. 2; S. 287 - 319
Hauptverfasser: Bezensek, Mitja, Robic, Borut
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Boston Springer US 01.04.2014
Springer Nature B.V
Schlagworte:
Algorithms
Approximation
Biology
Computation
Computer networks
Computer Science
Distributed processing
Graphs
Heuristic
Multicast
Optimization
Parallel processing
Processor Architectures
Ratios
Routing (telecommunications)
Software Engineering/Programming and Operating Systems
Studies
Theory of Computation
Trees
Wire
Parallel computing
Survey
Applications
Steiner tree
Distributed computing
Optimization
ISSN:0885-7458, 1573-7640
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
Bibliographie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:0885-7458
1573-7640
DOI:10.1007/s10766-013-0243-z