|
|
| |
| Universität Bonn -> Institut für Informatik -> Abteilung V | ||
| CS-APX-Reports 2000 | Copyright 2000 Universität Bonn, Institut für Informatik, Abt. V | |
|
8965 December 20, 2000 |
Approximability of Dense Instances of NEAREST CODEWORD Problem
Cristina Bazgan, W.Fernandez de la Vega and Marek Karpinski [Download PostScript] [Download PDF] We give a polynomial time approximation scheme (PTAS) for dense instances of the NEAREST CODEWORD problem. |
|
|
Last Change:
11/05/14 at 10:15:52
|
Universität Bonn -> Institut für Informatik -> Abteilung V | |