MPI-INF/SWS Research Reports 1991-2021

2. Number - only D1


Further improvements of Steiner tree approximations

Karpinksi, M. and Zelikovsky, Alexander

November 1994, 10 pages.

Status: available - back from printing

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.

URL to this document:

Hide details for BibTeXBibTeX
  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},