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

 
Universität Bonn -> Institut für Informatik -> Abteilung V
CS-APX-Reports 1994 Copyright 1994 Universität Bonn, Institut für Informatik, Abteilung V

8917 A Polynomial Time Subpolynom-Approximation Scheme for the Acyclic Directed Steiner Tree Problem
Alexander Zelikovsky
[Download PostScript] [Download PDF] [Abstract]
8918 Lower Bound for Randomized Linear Decision Trees Recognising a Union of Hyperplanes in a Generic Position
Dima Grigoriev, Marek Karpinski
[Download PostScript] [Download PDF] [Abstract]
8919 1.757 and 1.267 - Approximation Algorithms for the Network and Rectilinear Steiner Tree Problems
Marek Karpinski, Alexander Zelikovsky
[Download PostScript] [Download PDF] [Abstract]
8920 Polynomial Bounds for VC Dimension of Sigmoidal Neural Networks
Marek Karpinski, Angus Macintyre
[Download PostScript] [Download PDF] [Abstract]
8921 Randomized Navigation to a Wall through Convex Obstacles
Piotr Berman, Marek Karpinski
[Download PostScript] [Download PDF] [Abstract]
8922 Polynomial Time Approximation Schemes for Dense Instances of NP-Hard Problems
Sanjeev Arora, David Karger, Marek Karpinski
[Download PostScript] [Download PDF] [Abstract]
Last Change: 11/20/08 at 12:19:01
 English
Universität Bonn -> Institut für Informatik -> Abteilung V

Powered by Zope