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

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

8977 Approximating Huffman Codes in Parallel (Revised Version)
Piotr Berman, Marek Karpinski and Yakov Nekrich
[Download PostScript] [Download PDF] [Abstract]
8978 Polynomial Time Approximation Schemes for Metric Min-Sum Clustering
W. Fernandez de la Vega, Marek Karpinski, Claire Kenyon and Yuval Rabani
[Download PostScript] [Download PDF] [Abstract]
8979 Approximability of the Minimum Bisection Problem: An Algorithmic Challenge
Marek Karpinski
[Download PostScript] [Download PDF] [Abstract]
8980 A Polynomial Time Approximation Scheme for Metric MIN-BISECTION
W. Fernandez de la Vega, Marek Karpinski and Claire Kenyon
[Download PostScript] [Download PDF] [Abstract]
8981 A Polynomial Time Approximation Scheme for Subdense MAX-CUT
W. Fernandez de la Vega and Marek Karpinski
[Download PostScript] [Download PDF] [Abstract]
8982 Polynomial Time Approximation Schemes for Metric MIN-BISECTION (Extended Version)
W. Fernandez de la Vega, Marek Karpinski, Claire Kenyon
[Download PostScript] [Download PDF] [Abstract]
8983 Approximation Schemes for Clustering Problems in Finite Metrics and High Dimensional Spaces
W. Fernandez de la Vega, Marek Karpinski, Claire Kenyon, Yuval Rabani
[Download PostScript] [Download PDF] [Abstract]
8984 9/8-Approximation Algorithm for Random MAX-3SAT
W. Fernandez de la Vega, Marek Karpinski
[Download PostScript] [Download PDF] [Abstract]
Last Change: 02/04/03 at 10:26:16
 English
Universität Bonn -> Institut für Informatik -> Abteilung V

Powered by Zope