Department of Computer Science
 
Chair V

 
University of Bonn -> Department of Computer Science -> Chair V
CS-Reports 2000 Copyright 2000 University of Bonn, Department of Computer Science, Abt. V
85221

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
 Deutsch
University of Bonn -> Department of Computer Science -> Chair V