|
|
| |
| Universität Bonn -> Institut für Informatik -> Abteilung V | ||
| CS-Reports 2013 |
Copyright 2013 Universität Bonn,
Institut für Informatik, Abteilung V
|
|
| 85335 |
New Inapproximability Bounds for TSP
Marek Karpinski, Michael Lampis and Richard Schmied [Download PostScript] [Download PDF] [Abstract] |
|
| 85336 |
A Note on the Prize Collecting Bottleneck TSP and Related Problems
Fabian Hargesheimer [Download PostScript] [Download PDF] [Abstract] |
|
| 85337 |
The VC-Dimension of Graphs with Respect to k-Connected Subgraphs
Andrea Munaro [Download PostScript] [Download PDF] [Abstract] |
|
| 85338 |
Approximation Hardness of Graphic TSP on Cubic Graphs
Marek Karpinski and Richard Schmied [Download PostScript] [Download PDF] [Abstract] |
|
| 85339 |
Improved Inapproximability Results for the Shortest Superstring and the Bounded Metric TSP
Marek Karpinski and Richard Schmied [Download PostScript] [Download PDF] [Abstract] |
|
| 85340 |
Inapproximability of Dominating Set on Power Law Graphs (Revised Version)
Mikael Gast, Mathias Hauptmann and Marek Karpinski [Download PostScript] [Download PDF] [Abstract] |
|
| 85341 |
Algorithmic Perspectives of Network Transitive Reduction Problems
Satabdi Aditya, Bhaskar DasGupta and Marek Karpinski [Download PostScript] [Download PDF] [Abstract] |
|
| 85342 |
Generalized Wong Sequences and Their Applications to Edmonds' Problems
Gabor Ivanyos, Marek Karpinski, Youming Qiao, and Miklos Santha [Download PostScript] [Download PDF] [Abstract] |
|
| 85343 |
A Compendium on Steiner Tree Problems
Mathias Hauptmann and Marek Karpinski [Download PostScript] [Download PDF] [Abstract] |
|
| 85344 |
Approximation Taxonomy of Metric TSP
[Download PostScript] [Download PDF] [Abstract] |
|
| 85345 |
Prize Collecting Bottleneck Steiner Problems: A Combinatorial Approach
Fabian Hargesheimer [Download PostScript] [Download PDF] [Abstract] |
|
|
Last Change:
09/25/13 at 09:11:15
|
Universität Bonn -> Institut für Informatik -> Abteilung V | |