|
125
|
Interactive proofs and the hardness of approximating cliques
– Uriel Feige, Shafi Goldwasser, Laszlo Lovasz, Shmuel Safra, Mario Szegedy
- 1996
|
|
7
|
Approximating the Independence Number Via the Theta-Function
– Noga Alon, Nabil Kahale
- 1994
|
|
65
|
On the Hardness of Approximating the Chromatic Number
– Sanjeev Khanna, Nathan Linial, Shmuel Safra
- 1993
|
|
|
A Structural View Of Approximation
– Sanjeev Khanna, Rajeev Motwani
- 1996
|
|
3
|
Approximate Set Covering in Uniform Hypergraphs
– Michael Krivelevich
|
|
35
|
New Approximation Algorithms for Graph Coloring
– Avrim Blum
- 1994
|
|
|
Approximations of Independent Set Variants and Hereditary Subset Problems
– Magnús M. Halldórsson
- 1999
|
|
152
|
Zero Knowledge and the Chromatic Number
– Uriel Feige, Joe Kilian
- 1996
|
|
62
|
Derandomized Graph Products
– Noga Alon, Uriel Feige, Avi Wigderson, David Zuckerman
- 1996
|
|
|
The Weizmann Workshop on Probabilistic Proof Systems
– Uriel Feige, Shafi Goldwasser (Eds.), Shafi Goldwasser
- 1994
|
|
11
|
The approximability of NP-hard problems
– Sanjeev Arora
- 1998
|
|
191
|
Free Bits, PCPs and Non-Approximability -- Towards Tight Results
– Mihir Bellare, Oded Goldreich, Madhu Sudan
- 1996
|
|
53
|
On Approximating the Longest Path in a Graph
– David Karger, Rajeev Motwani, G.D.S. Ramkumar
- 1993
|
|
15
|
Spectral Techniques in Graph Algorithms
– Noga Alon
- 1998
|
|
14
|
Approximate coloring of uniform hypergraphs (Extended Abstract)
– Michael Krivelevich, Benny Sudakov
|
|
36
|
What color is your Jacobian? Graph coloring for computing derivatives
– Assefaw Hadish Gebremedhin, Fredrik Manne, Alex Pothen
- 2005
|
|
37
|
Randomized graph products, chromatic numbers, and the Lovász theta-function
– Uriel Feige
- 1996
|
|
29
|
Computing Near-Optimal Solutions to Combinatorial Optimization Problems
– David B. Shmoys
- 1995
|
|
4
|
Probabilistically Checkable Proofs and their Consequences for Approximation Algorithms
– S. Hougardy, H.J. Prömel, A. Steger
- 1995
|
