Department of Computer Science
 
Chair V

 
University of Bonn -> Department of Computer Science -> Chair V
CS-APX-Reports 2008 Copyright 2008 University of Bonn, Department of Computer Science, Abt. V
89115

10.10.2008

1.25 Approximation Algorithm for the Steiner Tree Problem
with Distances One and Two
Piotr Berman, Marek Karpinski and Alex Zelikovsky
[Download PostScript] [Download PDF]

We give a 1.25 approximation algorithm for the Steiner Tree Problem with distances one and two, improving on the best known bound for that problem.

Last Change: 11/05/14 at 10:41:05
 Deutsch 		University of Bonn -> Department of Computer Science -> Chair V