Max-Planck-Institut für Informatik
max planck institut
informatik
mpii logo Minerva of the Max Planck Society
 

MPI-I-94-158

Further improvements of Steiner tree approximations

Karpinksi, M. and Zelikovsky, Alexander

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.
Acknowledgement:
References to related material:

To download this research report, please select the type of document that fits best your needs.Attachement Size(s):
MPI-I-94-158.pdfMPI-I-94-158.pdf7732 KBytes
Please note: If you don't have a viewer for PostScript on your platform, try to install GhostScript and GhostView
URL to this document: http://domino.mpi-inf.mpg.de/internet/reports.nsf/NumberView/1994-158
Hide details for BibTeXBibTeX
@TECHREPORT{KarpinksiZelikovsky94,
  AUTHOR = {Karpinksi, M. and Zelikovsky, Alexander},
  TITLE = {Further improvements of Steiner tree approximations},
  TYPE = {Research Report},
  INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik},
  ADDRESS = {Im Stadtwald, D-66123 Saarbr{\"u}cken, Germany},
  NUMBER = {MPI-I-94-158},
  MONTH = {November},
  YEAR = {1994},
  ISSN = {0946-011X},
}