|
|
| |
| Universität Bonn -> Institut für Informatik -> Abteilung V | ||
| CS-APX-Reports 2010 |
Copyright
2010
Universität Bonn, Institut für Informatik, Abteilung V
|
|
| 89122 |
On Approximation Complexity of Edge Dominating Set Problem in Dense Graphs
Richard Schmied and Claus Viehmann [Download PostScript] [Download PDF] [Abstract] |
|
| 89123 |
Efficient Parallel Computation of Nearest Neighbor Interchange Distances (Preliminary Version) Mikael Gast and Mathias Hauptmann [Download PostScript] [Download PDF] [Abstract] |
|
| 89124 |
Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems (Revised Version) Piotr Berman, Marek Karpinski and Andrzej Lingas [Download PostScript] [Download PDF] [Abstract] |
|
| 89125 |
Faster Algorithms for Feedback Arc Set Tournament, Kemeny Rank Aggregation and Betweenness Tournament Marek Karpinski and Warren Schudy [Download PostScript] [Download PDF] [Abstract] |
|
| 89126 |
On Approximation Complexity of Metric Dimension Problem
Mathias Hauptmann, Richard Schmied and Claus Viehmann [Download PostScript] [Download PDF] [Abstract] |
|
| 89127 |
Approximating Subdense Instances of Covering Problems
Jean Cardinal, Marek Karpinski, Richard Schmied and Claus Viehmann [Download PostScript] [Download PDF] [Abstract] |
|
| 89128 |
Approximating Vertex Cover in Dense Hypergraphs
Jean Cardinal, Marek Karpinski, Richard Schmied and Claus Viehmann [Download PostScript] [Download PDF] [Abstract] |
|
|
Last Change:
12/13/10 at 13:29:35
|
Universität Bonn -> Institut für Informatik -> Abteilung V | |