Polynomial time approximation schemes for dense instances of minimum constraint satisfaction

View/ Open
Date
2003Dewey
Recherche opérationnelleSujet
Approximation Algorithms; Approximation Ratios; Polynomial Time Approximation Schemes; Minimum Constraint Satisfaction; Nearest Codeword Problem; Dense Instances; Hypergraph SamplingJournal issue
Random Structures and AlgorithmsVolume
23Number
1Publication date
2003Article pages
73-91Publisher
WileyCollections
Metadata
Show full item recordAuthor
Bazgan, Cristina
989 Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Fernandez de la Vega, Wenceslas
status unknown
Karpinski, Marek
status unknown