Thumbnail

Approximability of Dense Instances of NEAREST CODEWORD Problem

Bazgan, Cristina; Fernandez de la Vega, Wenceslas; Karpinski, Marek (2002), Approximability of Dense Instances of NEAREST CODEWORD Problem, in Penttonen, Martti; Meineche Schmidt, Erik, Algorithm Theory — SWAT 2002 8th Scandinavian Workshop on Algorithm Theory Turku, Finland, July 3–5, 2002 Proceedings, Springer : Berlin Heidelberg, p. 298-307. 10.1007/3-540-45471-3_31

View/Open
Type
Communication / Conférence
Date
2002
Conference title
8th Scandinavian Workshop on Algorithm Theory, SWAT 2002
Conference date
2002-07
Conference city
Turku
Conference country
Finland
Book title
Algorithm Theory — SWAT 2002 8th Scandinavian Workshop on Algorithm Theory Turku, Finland, July 3–5, 2002 Proceedings
Book author
Penttonen, Martti; Meineche Schmidt, Erik
Publisher
Springer
Published in
Berlin Heidelberg
ISBN
978-3-540-43866-3
Pages
298-307
Publication identifier
Metadata
Show full item record
Author(s)
Bazgan, Cristina
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Fernandez de la Vega, Wenceslas

Karpinski, Marek
Abstract (EN)
We give a polynomial time approximation scheme (PTAS) for dense instances of the Nearest Codeword problem.
Subjects / Keywords
approximation; dense instances