ausblenden:
Schlagwörter:
-
Zusammenfassung:
The Steiner tree problem requires to find a shortest tree
connecting a given set of terminal points in a metric space.
We suggest a better and fast heuristic for the Steiner problem
in graphs and in rectilinear plane. This heuristic finds a Steiner
tree at most 1.757 and 1.267 times longer than the optimal solution
in graphs and rectilinear plane, respectively.