Approximating the Independence Number and the Chromatic Number in Expected Polynomial Time

Approximation Algorithms for NP-Hard Problems

Dorit S. Hochba · ACM SIGACT News · 1997 · 3.1K citations · Full text

Computing, Computer Science, Mathematics +13

On the Shannon capacity of a graph

László Lovász · IEEE Transactions on Information Theory · 1979 · 1.7K citations

Computing, Computer Science, Mathematics +8

Clique is hard to approximate within n1−ε

Johan Håstad · Acta Mathematica · 1999 · 1.4K citations · Full text

Computing, Computer Science, Algorithms +3

The eigenvalues of random symmetric matrices

Zoltán Füredi, János Komlós · COMBINATORICA · 1981 · 673 citations

Natural Sciences, Mathematics, Probability Theory +8

The chromatic number of random graphs

B Bollobás · COMBINATORICA · 1988 · 371 citations

Natural Sciences, Mathematics, Combinatorics +10