|
|
| |
| University of Bonn -> Department of Computer Science -> Chair V | ||
| CS-APX-Reports 2008 |
Copyright
2008
University of Bonn, Department of Computer Science, Chair V
|
|
| 89111 |
The Measure Hypothesis and Efficiency of Polynomial Time Approximation Schemes
Mathias Hauptmann [Download PostScript] [Download PDF] [Abstract] |
|
| 89112 |
On the Approximability of Dense Steiner Problems
Mathias Hauptmann [Download PostScript] [Download PDF] [Abstract] |
|
| 89113 |
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] [Abstract] |
|
| 89114 |
Approximating Transitivity in Directed Networks
Piotr Berman, Bhaskar DasGupta and Marek Karpinski [Download PostScript] [Download PDF] [Abstract] |
|
| 89115 |
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] [Abstract] |
|
| 89116 |
Linear Time Approximation Schemes for the Gale-Berlekamp Game and Related Minimization Problems Marek Karpinski and Warren Schudy [Download PostScript] [Download PDF] [Abstract] |
|
| 89117 |
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] [Abstract] |
|
| 89118 |
Approximability of Selected Phylogenetic Tree Problems
Mathias Hauptmann and Marlis Lamp [Download PostScript] [Download PDF] [Abstract] |
|
|
Last Change:
12/18/08 at 13:58:47
|
University of Bonn -> Department of Computer Science -> Chair V | |