|
Universität Bonn -> Institut für Informatik -> Abteilung V | ||
CS-Reports 2008 |
Copyright 2008 Universität Bonn,
Institut für Informatik, Abteilung V
|
|
85286 |
The Measure Hypothesis and Efficiency of Polynomial Time Approximation Schemes
Mathias Hauptmann [Download PostScript] [Download PDF] [Abstract] |
|
85287 |
On the Approximability of Dense Steiner Problems
Mathias Hauptmann [Download PostScript] [Download PDF] [Abstract] |
|
85288 |
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] |
|
85289 |
Schemes for Deterministic Polynomial Factoring
Gábor Ivanyos, Marek Karpinski and Nitin Saxena [Download PostScript] [Download PDF] [Abstract] |
|
85290 |
Searching for Frequent Colors in Rectangles
Marek Karpinski, Yakov Nekrich [Download PostScript] [Download PDF] [Abstract] |
|
85291 |
Mixing Rate of Glauber Dynamics for Sampling Colourings of Regular Trees with Few Colours Leslie Ann Goldberg, Mark Jerrum and Marek Karpinski [Download PostScript] [Download PDF] [Abstract] |
|
85292 |
Space-Efficient Multi-Dimensional Range Reporting
Marek Karpinski, Yakov Nekrich [Download PostScript] [Download PDF] [Abstract] |
|
85293 |
Approximating Transitivity in Directed Networks
Piotr Berman, Bhaskar DasGupta and Marek Karpinski [Download PostScript] [Download PDF] [Abstract] |
|
85294 |
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] |
|
85295 |
Trading GRH for Algebra: Algorithms for Factoring Polynomials and Related Structures Gábor Ivanyos, Marek Karpinski, Lajos Rónyai and Nitin Saxena [Download PostScript] [Download PDF] [Abstract] |
|
85296 |
Linear Time Approximation Schemes for the Gale-Berlekamp Game and Related Minimization Problems Marek Karpinski and Warren Schudy [Download PostScript] [Download PDF] [Abstract] |
|
85297 |
Low-Memory Adaptive Prefix Coding
Travis Gagie, Marek Karpinski, Yakov Nekrich [Download PostScript] [Download PDF] [Abstract] |
|
85298 |
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] |
|
85299 |
Approximability of Selected Phylogenetic Tree Problems
Mathias Hauptmann and Marlis Lamp [Download PostScript] [Download PDF] [Abstract] |
|
85300 |
Scaled Dimension and the Berman-Hartmanis Conjecture
Mathias Hauptmann [Download PostScript] [Download PDF] [Abstract] |
|
Last Change:
12/18/08 at 13:58:47
English |
Universität Bonn -> Institut für Informatik -> Abteilung V |