|
|
| |
| University of Bonn -> Department of Computer Science -> Chair V | ||
| CS-APX-Reports 1994 | Copyright 1994 University of Bonn, Department of Computer Science, Abt. V | |
|
8919
|
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
|
University of Bonn -> Department of Computer Science -> Chair V | |