Rheinische Friedrich-Wilhelms-Universität Bonn Institut für Informatik
 
Abteilung V

 
Universität Bonn -> Institut für Informatik -> Abteilung V
CS-Reports 1994 Copyright 1994 Universität Bonn, Institut für Informatik, Abt. V
85115

1.757 and 1.267 - Approximation Algorithms for the Network and Rectilinear Steiner Tree Problems
Marek Karpinski, Alexander Zelikovsky
[Download PostScript] [Download PDF]

The Steiner tree problem requires to find a shortest tree connecting a given set of terminal points in a metric space. We suggest better and fast heuristics for the Steiner problem in graphs and in rectilinear plane with the record worst-case performance ratios 1.648 and 1.267, respectively.

Last Change: 11/05/14 at 09:52:27
 English
Universität Bonn -> Institut für Informatik -> Abteilung V

Powered by Zope