A note on the approximation of the max clique problem

Generalized first-order spectra and polynomial-time recognizable sets

Ronald Fagin · Medical Entomology and Zoology · 1974 · 834 citations

Natural Sciences, Computer Science, Mathematics +9

Approximating clique is almost NP-complete

Uriel Feige, S. Goldwasser, László Lovász et al. · 2002 · 397 citations

Computing, Computer Science, Algorithms +15

The Complexity of Near-Optimal Graph Coloring

M. R. Garey, David S. Johnson · Journal of the ACM · 1976 · 326 citations · Full text

Computing, Computer Science, Mathematics +16

Optimization, approximation, and complexity classes

Christos H. Papadimitriou, Mihalis Yannakakis · 1988 · 213 citations · Full text

Computing, Computer Science, Mathematics +12

Logical Definability of NP Optimization Problems

Phokion G. Kolaitis, M.N. Thakur · Information and Computation · 1994 · 94 citations

Natural Sciences, Computer Science, Mathematics +14