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

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

89143 New Inapproximability Bounds for TSP
Marek Karpinski, Michael Lampis and Richard Schmied
[Download PostScript] [Download PDF] [Abstract]
89144 A Note on the Prize Collecting Bottleneck TSP and Related Problems
Fabian Hargesheimer
[Download PostScript] [Download PDF] [Abstract]
89145 The VC-Dimension of Graphs with Respect to k-Connected Subgraphs
Andrea Munaro
[Download PostScript] [Download PDF] [Abstract]
89146 Approximation Hardness of Graphic TSP on Cubic Graphs
Marek Karpinski and Richard Schmied
[Download PostScript] [Download PDF] [Abstract]
89147 Improved Inapproximability Results for the Shortest Superstring and the Bounded Metric TSP
Marek Karpinski and Richard Schmied
[Download PostScript] [Download PDF] [Abstract]
89148 Inapproximability of Dominating Set on Power Law Graphs (Revised Version)
Mikael Gast, Mathias Hauptmann and Marek Karpinski
[Download PostScript] [Download PDF] [Abstract]
89149 Algorithmic Perspectives of Network Transitive Reduction Problems
Satabdi Aditya, Bhaskar DasGupta and Marek Karpinski
[Download PostScript] [Download PDF] [Abstract]
89150 A Compendium on Steiner Tree Problems
Mathias Hauptmann and Marek Karpinski
[Download PostScript] [Download PDF] [Abstract]
89151 Approximation Taxonomy of Metric TSP

[Download PostScript] [Download PDF] [Abstract]
89152 Prize Collecting Bottleneck Steiner Problems: A Combinatorial Approach
Fabian Hargesheimer
[Download PostScript] [Download PDF] [Abstract]
Last Change: 09/25/13 at 09:11:15
 English
Universität Bonn -> Institut für Informatik -> Abteilung V

Powered by Zope