|
|
| |
| University of Bonn -> Department of Computer Science -> Chair V | ||
| CS-APX-Reports 1995 | Copyright 1995 University of Bonn, Department of Computer Science, Abt. V | |
|
8925
|
A New Approach to Approximation of Steiner Trees
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 design approximation algorithms for the Steiner problems in graphs and in the rectilinear plane with the best up to now ratios 1.644 and 1.267, respectively. |
|
|
Last Change:
11/05/14 at 09:56:40
|
University of Bonn -> Department of Computer Science -> Chair V | |