Approximating clique is almost NP-complete (preliminary version)

Authors:
U. Feige;S. Goldwasser;L. Lovász;S. Safra;M. Szegedy
Affiliations:
-;-;-;-;-
Venue:
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Year:
1991

Citing 0
Cited 78

Self-testing polynomial functions efficiently and over rational domains

SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
On the hardness of approximating minimization problems

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Efficient probabilistically checkable proofs and applications to approximations

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Probabilistically checkable debate systems and approximation algorithms for PSPACE-hard functions

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
A taxonomy of proof systems (part 2)

ACM SIGACT News
Two prover protocols: low error at affordable rates

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Improved non-approximability results

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Nearly-linear size holographic proofs

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Efficient probabilistic checkable proofs and applications to approximation

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Polynomial time approximation schemes for dense instances of NP-hard problems

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
A parallel repetition theorem

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Impossibility results for recycling random bits in two-prover proof systems

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Randomized graph products, chromatic numbers, and Lovasz j-function

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Interactive proofs and the hardness of approximating cliques

Journal of the ACM (JACM)
Testing of the long code and hardness for clique

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Property testing in bounded degree graphs

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Probabilistic checking of proofs: a new characterization of NP

Journal of the ACM (JACM)
A sublinear bipartiteness tester for bounded degree graphs

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Property testing and its connection to learning and approximation

Journal of the ACM (JACM)
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems

Journal of the ACM (JACM)
On the hardness of approximating minimization problems

Journal of the ACM (JACM)
Coloring with defect

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Low-degree tests

SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Finding maximum independent sets in sparse and general graphs

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Finding a large hidden clique in a random graph

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Wire packing: a strong formulation of crosstalk-aware chip-level track/layer assignment with an efficient integer programming solution

ISPD '00 Proceedings of the 2000 international symposium on Physical design
A PCP characterization of NP with optimal amortized query complexity

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Hardness and methods to solve CLIQUE

Journal of Computer Science and Technology
Bounded queries, approximations, and the Boolean hierarchy

Information and Computation
The hardness of cache conscious data placement

POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The importance of being biased

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Performance of Neural Net Heuristics for Maximum Clique on DiverseHighly Compressible Graphs

Journal of Global Optimization
Annealed replication: a new heuristic for the maximum clique problem

Discrete Applied Mathematics
The inapproximability of non-NP-hard optimization problems

Theoretical Computer Science
Exact and approximate testing/correcting of algebraic functions: a survey

Theoretical aspects of computer science
Genetic, Iterated and Multistart Local Search for the Maximum Clique Problem

Proceedings of the Applications of Evolutionary Computing on EvoWorkshops 2002: EvoCOP, EvoIASP, EvoSTIM/EvoPLAN
A Distributed Algorithm for Max Independent Set Problem Based on Hopfield Networks

WIRN VIETRI 2002 Proceedings of the 13th Italian Workshop on Neural Nets-Revised Papers
Non-Interactive Zero-Knowledge: A Low-Randomness Characterization of NP

ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
The Inapproximability of Non NP-hard Optimization Problems

ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Massive Quasi-Clique Detection

LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Low Communication 2-Prover Zero-Knowledge Proofs for NP

CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Improved Efficient Arguments (Preliminary Version)

CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
Using Approximation Hardness to Achieve Dependable Computation

RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
Cryptography 2000±10

Informatics - 10 Years Back. 10 Years Ahead.
Exact and Approximate Testing/Correcting of Algebraic Functions: A Survey

Theoretical Aspects of Computer Science, Advanced Lectures [First Summer School on Theoretical Aspects of Computer Science, Tehran, Iran, July 2000]
Fast Winner-Takes-All Networks for the Maximum Clique Problem

KI '02 Proceedings of the 25th Annual German Conference on AI: Advances in Artificial Intelligence
Modelling competitive Hopfield networks for the maximum clique problem

Computers and Operations Research
On Operators of Higher Types

CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
An efficient approximation algorithm for finding a maximum clique using Hopfield network learning

Neural Computation
Breaking Instance-Independent Symmetries in Exact Graph Coloring

Proceedings of the conference on Design, automation and test in Europe - Volume 1
An effective local search for the maximum clique problem

Information Processing Letters
Finding Frequent Patterns in a Large Sparse Graph*

Data Mining and Knowledge Discovery
SIGACT news complexity theory column 51

ACM SIGACT News
Innovative computational methods for transcriptomic data analysis

Proceedings of the 2006 ACM symposium on Applied computing
The hardness of cache conscious data placement

Nordic Journal of Computing
The NP-completeness column: The many limits on approximation

ACM Transactions on Algorithms (TALG)
Foundations of cryptography: a primer

Foundations and Trends® in Theoretical Computer Science
Out-of-core coherent closed quasi-clique mining from large dense graph databases

ACM Transactions on Database Systems (TODS)
Polylogarithmic-round interactive proofs for coNP collapse the exponential hierarchy

Theoretical Computer Science
Vertex cover might be hard to approximate to within 2-ε

Journal of Computer and System Sciences
Parallel repetition in projection games and a concentration bound

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
The 0-1 inverse maximum stable set problem

Discrete Applied Mathematics
Error Correcting Codes from Quasi-Hadamard Matrices

WAIFI '07 Proceedings of the 1st international workshop on Arithmetic of Finite Fields
Breaking the ε-Soundness Bound of the Linearity Test over GF(2)

APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
CSP gaps and reductions in the lasserre hierarchy

Proceedings of the forty-first annual ACM symposium on Theory of computing
Breaking instance-independent symmetries in exact graph coloring

Journal of Artificial Intelligence Research
A note on the approximation of the max clique problem

Information Processing Letters
An effective local search for the maximum clique problem

Information Processing Letters
Separating succinct non-interactive arguments from all falsifiable assumptions

Proceedings of the forty-third annual ACM symposium on Theory of computing
Using the FGLSS-reduction to prove inapproximability results for minimum vertex cover in hypergraphs

Studies in complexity and cryptography
Bravely, moderately: a common theme in four recent works

Studies in complexity and cryptography
Computational complexity since 1980

FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Average-case non-approximability of optimisation problems

FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Parallel Repetition in Projection Games and a Concentration Bound

SIAM Journal on Computing
An efficiently computable support measure for frequent subgraph pattern mining

ECML PKDD'12 Proceedings of the 2012 European conference on Machine Learning and Knowledge Discovery in Databases - Volume Part I
Large scale cohesive subgraphs discovery for social network visual analysis

Proceedings of the VLDB Endowment
Comparable dependencies over heterogeneous data

The VLDB Journal — The International Journal on Very Large Data Bases

Quantified Score

Hi-index	0.00

Visualization

Abstract

The computational complexity of approximating omega (G), the size of the largest clique in a graph G, within a given factor is considered. It is shown that if certain approximation procedures exist, then EXPTIME=NEXPTIME and NP=P.