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

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

8936 An Approximation Algorithm for the Bandwidth Problem on Dense Graphs
Marek Karpinski, Juergen Wirtgen, Alex Zelikovsky
[Download PostScript] [Download PDF] [Abstract]
8937 Approximate Counting of Given Length Cycles
Carsten Dorgerloh, Juergen Wirtgen
[Download PostScript] [Download PDF] [Abstract]
8938 Polynomial Time Approximability of Dense Weighted Instances of MAX-CUT
W. Fernandez de la Vega, Marek Karpinski
[Download PostScript] [Download PDF] [Abstract]
8939 Polynomial Time Approximation Schemes for Some Dense Instances of NP-Hard Optimization Problems
Marek Karpinski
[Download PostScript] [Download PDF] [Abstract]
8940 Approximating Volumes and Integrals in o-Minimal and p-Minimal Theories
Marek Karpinski, Angus Macintyre
[Download PostScript] [Download PDF] [Abstract]
8941 On Approximation Hardness of the Bandwidth Problem
Marek Karpinski, Juergen Wirtgen
[Download PostScript] [Download PDF] [Abstract]
8942 Ultrafast Randomized Parallel Construction- and Approximation Algorithms for Spanning Forests in Dense Graphs
Anders Dessmark, Carsten Dorgerloh, Andrzej Lingas, Juergen Wirtgen
[Download PostScript] [Download PDF] [Abstract]
8943 On Approximation Intractability of the Bandwidth Problem
Gunter Blache, Marek Karpinski, Juergen Wirtgen
[Download PostScript] [Download PDF] [Abstract]
Last Change: 02/04/03 at 10:30:35
 English
Universität Bonn -> Institut für Informatik -> Abteilung V

Powered by Zope