Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > DETAIL:

Paper:

TR95-003 | 1st January 1995 00:00

1.757 and 1.267-Approximation Algorithms for the Network and and Rectilinear Steiner Tree Problems

RSS-Feed




TR95-003
Authors: Marek Karpinski, Alexander Zelikovsky
Publication: 1st January 1995 00:00
Downloads: 1316
Keywords: 


Abstract:

The Steiner tree problem requires to find a shortest tree connection
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.



ISSN 1433-8092 | Imprint