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

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

85246 A Work-Efficient Algorithm for Constructing Huffman Codes
Marek Karpinski, Lawrence Larmore and Yakov Nekrich
[Download PostScript] [Download PDF] [Abstract]
85247 1.0957-Approximation Algorithm for Random MAX-3SAT
W. Fernandez de la Vega and Marek Karpinski
[Download PostScript] [Download PDF] [Abstract]
85248 Improved Approximation Lower Bounds on Small Occurrence Optimization
Piotr Berman and Marek Karpinski
[Download PostScript] [Download PDF] [Abstract]
85249 Approximation Hardness and Satisfiability of Bounded Occurrence Instances of SAT
Piotr Berman, Marek Karpinski and Alex D. Scott
[Download PostScript] [Download PDF] [Abstract]
85250 Approximation Schemes for Metric Minimum Bisection and Partitioning
W. Fernandez de la Vega, Marek Karpinski and Claire Kenyon
[Download PostScript] [Download PDF] [Abstract]
85251 On Approximability of Minimum Bisection and Related Partition Problems
Marek Karpinski
[Download PostScript] [Download PDF] [Abstract]
85252 Approximation Hardness of Short Symmetric Instances of MAX-3SAT
Piotr Berman, Marek Karpinski and Alexander D. Scott
[Download PostScript] [Download PDF] [Abstract]
85253 Improved Approximation Algorithms for the Quality of Service Steiner Tree Problem
Marek Karpinski, Ion I. Mandoiu, Alexander Olshevsky and Alexander Zelikovsky
[Download PostScript] [Download PDF] [Abstract]
85254 Approximability of Hypergraph Minimum Bisection
Piotr Berman and Marek Karpinski
[Download PostScript] [Download PDF] [Abstract]
Last Change: 07/29/03 at 08:52:40
 English
Universität Bonn -> Institut für Informatik -> Abteilung V

Powered by Zope