...In R. Karp, editor, Complexity and Computations. AMS, 1974. [10] U. Feige, S. Goldwasser, L. Lovasz, S. Safra, and M. Szegedy. Approximating clique is almost NP-complete. In Proc. of SSnd Annual IEEE Sympos. on Foundations of Computer Science, pages 2-12, 1991. [11] MR Garey and...

...problem. In Information and Computation, 96, pp. 77-94, 1992. 8. U. Feige, S. Goldwasser, L. Lovasz, S. Safra, and M. Szegedy. Approximating clique is almost NP-complete. In Proc. of the 32nd IEEE Symp. on Foundations of Computer Science, pp. 2-12, 1991. 9. U. Feige and L. Lovasz....

...S. Rudich, and S. Smolensky, t-refilient functions In: Proc. 26th FOGS, IEEE 1985, pp. 396-407. [12] U. Feige, S. Goldwasser, L. Lovász, S. Safra, and...Approximating clique is almost NP-complete, In: Proc. 32nd FOGS, IEEE 1991, pp. 2-12. [13] U. Feige and L. Lovász, Two-prover one-round proof systems: their...

...Symposium on the Theory of Computing, pages 407—416, 1995. [FGL¿91] U. Feige, S. Goldwasser, L. Lovasz, S. Safra, and M. Szegedy. Approximating clique is almost NP-complete. In Proc. 32nd Annual IEEE Symposium on Foundations of Computer Science, pages 2—12, 1991. [GLR¿91] P. Gemmell,...

...Shmoys, and E. Tardos. Fast approximation algorithms for fractional packing and covering problems. In Proc. 32nd IEEE Annual Symposium on Foundations of Computer Science, pages 495-504, October 1991. [33] F. Shahrokhi and D. Matula. The maximum concurrent flow problem. J. Assoc....

...Halldórsson, Approximating maximum independent sets by excluding subgraphs, BIT, 32 (1992), 180-196. [9] U. Feige, S. Goldwasser, L. Lovász, S. Safra and...Szegedy, Approximating Clique is almost NPcomplete, Proc. of the 32nd IEEE FOCS, IEEE (1991), 2-12. [10] A. Frieze and C. McDiarmid, Algorithmic theory...