|
|
| |
| University of Bonn -> Department of Computer Science -> Chair V | ||
| CS-Reports 2002 |
Copyright 2002 University of Bonn,
Department of Computer Science, Chair V
|
|
| 85235 |
Approximating Huffman Codes in Parallel (Revised Version)
Piotr Berman, Marek Karpinski and Yakov Nekrich [Download PostScript] [Download PDF] [Abstract] |
|
| 85237 |
Parallel Construction of the Minimum Redundancy
Length-Limited Codes
Marek Karpinski and Yakov Nekrich [Download PostScript] [Download PDF] [Abstract] |
|
| 85238 |
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] |
|
| 85239 |
Approximability of the Minimum Bisection Problem: An Algorithmic Challenge
Marek Karpinski [Download PostScript] [Download PDF] [Abstract] |
|
| 85240 |
A Polynomial Time Approximation Scheme for Metric MIN-BISECTION
W. Fernandez de la Vega, Marek Karpinski and Claire Kenyon [Download PostScript] [Download PDF] [Abstract] |
|
| 85241 |
A Polynomial Time Approximation Scheme for Subdense MAX-CUT
W. Fernandez de la Vega and Marek Karpinski [Download PostScript] [Download PDF] [Abstract] |
|
| 85242 |
Polynomial Time Approximation Schemes for Metric MIN-BISECTION (Extended Version)
W. Fernandez de la Vega, Marek Karpinski, Claire Kenyon [Download PostScript] [Download PDF] [Abstract] |
|
| 85243 |
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] |
|
| 85244 |
Finding one of many Disjoint Perfect Matchings in a Bipartite Graph
Martin Löhnertz [Download PostScript] [Download PDF] [Abstract] |
|
| 85245 |
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
|
University of Bonn -> Department of Computer Science -> Chair V | |