Suche Bilder Maps Play YouTube News Gmail Drive Mehr »
Anmelden
Books Bücher 1 - 5 von 5 in U. Feige, S. Goldwasser, L. Lovasz, S. Safra, and M. Szegedy. Approximating clique...
" U. Feige, S. Goldwasser, L. Lovasz, S. Safra, and M. Szegedy. Approximating clique is almost NPcomplete. In Proc. "
Approximation Algorithms - Seite 362
von Vijay V. Vazirani - 2002 - 380 Seiten
Eingeschränkte Leseprobe - Über dieses Buch

STACS 92: 9th Annual Symposium on Theoretical Aspects of Computer Science ...

Alain Finkel - 1992 - 620 Seiten
...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...
Eingeschränkte Leseprobe - Über dieses Buch

Automata, Languages and Programming: 20th International Colloquium, ICALP 93 ...

Andrzej Lingas, Rolf Karlsson, Svante Carlsson - 1993 - 697 Seiten
...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....
Eingeschränkte Leseprobe - Über dieses Buch

Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms

1994 - 735 Seiten
...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...
Eingeschränkte Leseprobe - Über dieses Buch

Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms

1996 - 586 Seiten
...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....
Eingeschränkte Leseprobe - Über dieses Buch

Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms

Howard Karloff - 1998 - 704 Seiten
...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...
Eingeschränkte Leseprobe - Über dieses Buch




  1. Meine Bücher
  2. Hilfe
  3. Erweiterte Buchsuche