Rheinische Friedrich-Wilhelms-Universität Bonn Institut für Informatik
 
Abteilung V

 
Universität Bonn -> Institut für Informatik -> Abteilung V
CS-APX-Reports 2008 Copyright 2008 Universität Bonn, Institut für Informatik, Abt. V
89113

16.02.2008

Polynomial Time Approximation Schemes for Dense and Geometric k-Restricted Forest Problems
Mathias Hauptmann, Sören Kühl, Richard Schmied and Claus Viehmann
[Download PostScript] [Download PDF]

The k-Steiner Forest Problem asks for a minimum cost forest F for a given terminal set S such that F consists of at most k connected components. We construct polynomial time approximation schemes for dense and geometric versions of the k-Steiner Forest Problem and the k-Tree Cover Problem.

Last Change: 11/05/14 at 10:41:45
 English
Universität Bonn -> Institut für Informatik -> Abteilung V

Powered by Zope