Towards Strong Nonapproximability Results in the Lovász-Schrijver Hierarchy

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

A threshold of ln <i>n</i> for approximating set cover

Uriel Feige · Journal of the ACM · 1998 · 3.1K citations · Full text

Natural Sciences, Computer Science, Mathematics +16

Cones of Matrices and Set-Functions and 0–1 Optimization

László Lovász, Alexander Schrijver · SIAM Journal on Optimization · 1991 · 1K citations

Natural Sciences, Computer Science, Mathematics +17

A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems

Hanif D. Sherali, Warren P. Adams · SIAM Journal on Discrete Mathematics · 1990 · 946 citations

Natural Sciences, Computer Science, Algorithms +16

On the power of unique 2-prover 1-round games

Subhash Khot · 2002 · 854 citations

Social Sciences, Mathematics, Cryptography +6