Work

Approximating clique is almost NP-complete

Year: 2002

Type: conference-paper

Source: Annual Symposium on Foundations of Computer Science

DOI: 10.1109/sfcs.1991.185341

Authors: U. Feige, S. Goldwasser, L. Lovasz, S. Safra, M. Szegedy

Institutions: Princeton University, Anna University, Chennai, Massachusetts Institute of Technology, Eötvös Loránd University, University of Chicago

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: closed

OpenAlex ID: W2141815340

FWCI: 21.72

Cites: 26

Cited by: 414

Related to: 10