Geodesic
1.0957 - Approximation algorithm for Random MAX-3SAT
RAIRO - Operations Research - Recherche Opérationnelle, Tome 41 (2007) no. 1, pp. 95-103

Voir la notice de l'article provenant de la source Numdam

We prove that MAX-3SAT can be approximated in polynomial time within a factor 1.0957 on random instances.

DOI : 10.1051/ro:2007008
Classification : 68W25, 03B70
Keywords: random satisfiability, approximate algorithms 
@article{RO_2007__41_1_95_0,
     author = {Fernandez de La Vega, Wenceslas and Karpinski, Marek},
     title = {1.0957 - {Approximation} algorithm for {Random} {MAX-3SAT}},
     journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
     pages = {95--103},
     publisher = {EDP-Sciences},
     volume = {41},
     number = {1},
     year = {2007},
     doi = {10.1051/ro:2007008},
     mrnumber = {2310542},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.1051/ro:2007008/}
}
TY  - JOUR
AU  - Fernandez de La Vega, Wenceslas
AU  - Karpinski, Marek
TI  - 1.0957 - Approximation algorithm for Random MAX-3SAT
JO  - RAIRO - Operations Research - Recherche Opérationnelle
PY  - 2007
SP  - 95
EP  - 103
VL  - 41
IS  - 1
PB  - EDP-Sciences
UR  - http://geodesic.mathdoc.fr/articles/10.1051/ro:2007008/
DO  - 10.1051/ro:2007008
LA  - en
ID  - RO_2007__41_1_95_0
ER  - 
%0 Journal Article
%A Fernandez de La Vega, Wenceslas
%A Karpinski, Marek
%T 1.0957 - Approximation algorithm for Random MAX-3SAT
%J RAIRO - Operations Research - Recherche Opérationnelle
%D 2007
%P 95-103
%V 41
%N 1
%I EDP-Sciences
%U http://geodesic.mathdoc.fr/articles/10.1051/ro:2007008/
%R 10.1051/ro:2007008
%G en
%F RO_2007__41_1_95_0
Fernandez de La Vega, Wenceslas; Karpinski, Marek. 1.0957 - Approximation algorithm for Random MAX-3SAT. RAIRO - Operations Research - Recherche Opérationnelle, Tome 41 (2007) no. 1, pp. 95-103. doi: 10.1051/ro:2007008

Cité par Sources :