Department of Computer Science
 
Chair V

 
University of Bonn -> Department of Computer Science -> Chair V
CS-APX-Reports 1998 Copyright 1998 University of Bonn, Department of Computer Science, Chair V

8944 ESPRIT Working Group: 21726 Randomized Algorithms (RAND2) Annual Progress Report
Marek Karpinski
[Download PostScript] [Download PDF] [Abstract]
8945 On Approximation Hardness of Dense TSP and other Path Problems
W. Fernandez de la Vega, Marek Karpinski
[Download PostScript] [Download PDF] [Abstract]
8946 ESPRIT BR Project RAND-REC EC-US Exploratory Collaborative Activity -- EC-US 030 Final Progress Report July 1, 1993 -- September 30, 1997
Marek Karpinski
[Download PostScript] [Download PDF] [Abstract]
8947 Approximation Algorithms for Bandwidth Problems on some large Graph Classes
Juergen Wirtgen
[Download PostScript] [Download PDF] [Abstract]
8948 Approximation of the Permanent for Graphs of Density Less than 1/2 is hard
Elias Dahlhaus, Marek Karpinski
[Download PostScript] [Download PDF] [Abstract]
8949 On Some Tighter Inaproximability Results
Piotr Berman, Marek Karpinski
[Download PostScript] [Download PDF] [Abstract]
8950 Polynomial Time Approximation Schemes for Dense Instances of NP-Hard Problems
Sanjeev Arora, David Karger, Marek Karpinski
[Download PostScript] [Download PDF] [Abstract]
8951 NP-Hardness of the Bandwidth Problem on Dense Graphs (Revised)
Marek Karpinski, Juergen Wirtgen
[Download PostScript] [Download PDF] [Abstract]
8952 On Some Tighter Inapproximability Results, Further Improvements
Marek Karpinski, Piotr Berman
[Download PostScript] [Download PDF] [Abstract]
8953 A Note on Las Vegas OBBDs
Marek Karpinski, Rustam Mubarakzjanov
[Download PostScript] [Download PDF] [Abstract]
Last Change: 11/19/08 at 15:33:43
 Deutsch
University of Bonn -> Department of Computer Science -> Chair V