MPI-I-94-158. November 1994, 10 pages. | Status: available - back from printing | Next --> Entry | Previous <-- Entry
Abstract in LaTeX format:
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.
References to related material:
|To download this research report, please select the type of document that fits best your needs.||Attachement Size(s):|
|Please note: If you don't have a viewer for PostScript on your platform, try to install GhostScript and GhostView|