
University of Bonn > Department of Computer Science > Chair V  
CSAPXReports 2008  Copyright 2008 University of Bonn, Department of Computer Science, Abt. V  
89117 11.12.2008 
A Factor 3/2 Approximation for Generalized Steiner Tree Problem with Distances One and Two
Piotr Berman, Marek Karpinski and Alex Zelikovsky [Download PostScript] [Download PDF] We design a 3/2 approximation algorithm for the Generalized Steiner Tree problem (GST) in metrics with distances 1 and 2. This is the first polynomial time approximation algorithm for a wide class of nongeometric metric GST instances with approximation factor below 2. 

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