Some APX-completeness results for cubic graphs

Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

Michel X. Goemans, David P. Williamson · Journal of the ACM · 1995 · 3.7K citations · Full text

Computing, Computer Science, Algorithms +14

Optimization, approximation, and complexity classes

Christos H. Papadimitriou, Mihalis Yannakakis · Journal of Computer and System Sciences · 1991 · 1.7K citations

Computing, Computer Science, Mathematics +12

On the hardness of approximating minimization problems

Carsten Lund, Mihalis Yannakakis · Journal of the ACM · 1994 · 890 citations · Full text

Computing, Computer Science, Algorithms +5

Maximum bounded 3-dimensional matching is MAX SNP-complete

Viggo Kann · Information Processing Letters · 1991 · 280 citations

Computing, Computer Science, Data Structures +6

Probabilistic checking of proofs; a new characterization of NP

Sanjeev Arora · 1992 · 278 citations

Computing, Computer Science, Mathematics +16