Some optimal inapproximability results
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Approximately counting up to four (extended abstract)
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)
Approximate graph coloring by semidefinite programming
Journal of the ACM (JACM)
Recycling queries in PCPs and in linearity tests (extended abstract)
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
The approximability of NP-hard problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Proof verification and the hardness of approximation problems
Journal of the ACM (JACM)
A threshold of ln n for approximating set cover
Journal of the ACM (JACM)
Property testing and its connection to learning and approximation
Journal of the ACM (JACM)
Time-constrained scheduling of weighted packets on trees and meshes
Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures
The algorithmic aspects of uncrowded hypergraphs
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
On multi-dimensional packing problems
Proceedings of the tenth 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
Hiding cliques for cryptographic security
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
On the approximability of the traveling salesman problem (extended abstract)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
The value of strong inapproximability results for clique
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
A PCP characterization of NP with optimal amortized query complexity
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
eMediator: a next generation electronic commerce server
AGENTS '00 Proceedings of the fourth international conference on Autonomous agents
Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Hiding Cliques for Cryptographic Security
Designs, Codes and Cryptography
Polynomial-time approximation schemes for geometric graphs
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
The hardness of cache conscious data placement
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Hardness results for approximate hypergraph coloring
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
On the power of unique 2-prover 1-round games
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Pricing multicasting in more practical network models
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
On aggregation issues in spatial data management
ADC '02 Proceedings of the 13th Australasian database conference - Volume 5
Scalable analysis and design of ad hoc networks via random graph theory
DIALM '02 Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications
On approximating the maximum diameter ratio of graphs
Discrete Mathematics - Algebraic and topological methods in graph theory
A Note on the Approximation of a Minimum-Weight Maximal Independent Set
Computational Optimization and Applications
Annealed replication: a new heuristic for the maximum clique problem
Discrete Applied Mathematics
The inapproximability of non-NP-hard optimization problems
Theoretical 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
Coloring k-Colorable Semirandom Graphs in Polynomial Expected Time via Semidefinite Programming
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
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
On Some Tighter Inapproximability Results (Extended Abstract)
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Stable Marriage with Incomplete Lists and Ties
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Clique Is Hard to Approximate within n1-o(1)
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Approximating the Independence Number and the Chromatic Number in Expected Polynominal Time
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Generalized Graph Colorability and Compressibility of Boolean Formulae
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
How Many People Can Hide in a Terrain?
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Go with the Winners Algorithms for Cliques in Random Graphs
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Small PCPs with Low Query Complexity
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Approximation Algorithms for Independent Sets in Map Graphs
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Planning Geometric Constraint Decomposition via Optimal Graph Transformations
AGTIVE '99 Proceedings of the International Workshop on Applications of Graph Transformations with Industrial Relevance
Maximum dispersion and geometric maximum weight cliques
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
MAXIMUM CLIQUE and MINIMUM CLIQUE PARTITION in Visibility Graphs
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Approximate Coloring of Uniform Hypergraphs (Extended Abstract)
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Finding Large Independent Sets in Polynomial Expected Time
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Property testing in massive graphs
Handbook of massive data sets
Complexity in the case against accuracy estimation
Theoretical Computer Science
Data-dependent margin-based generalization bounds for classification
The Journal of Machine Learning Research
Approximate coloring of uniform hypergraphs
Journal of Algorithms
A new PCP outer verifier with applications to homogeneous linear equations and max-bisection
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Local ratio: A unified framework for approximation algorithms. In Memoriam: Shimon Even 1935-2004
ACM Computing Surveys (CSUR)
Adaptivity and approximation for stochastic packing problems
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
The complexity of base station positioning in cellular networks
Discrete Applied Mathematics
Pricing multicasting in more flexible network models
ACM Transactions on Algorithms (TALG)
Replicator Equations, Maximal Cliques, and Graph Isomorphism
Neural Computation
Payoff-Monotonic Game Dynamics and the Maximum Clique Problem
Neural Computation
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)
A new trust region technique for the maximum weight clique problem
Discrete Applied Mathematics - Special issue: International symposium on combinatorial optimization CO'02
Out-of-core coherent closed quasi-clique mining from large dense graph databases
ACM Transactions on Database Systems (TODS)
Approximating TSP on metrics with bounded global growth
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Robust Combinatorial Optimization with Exponential Scenarios
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
Error Correcting Codes from Quasi-Hadamard Matrices
WAIFI '07 Proceedings of the 1st international workshop on Arithmetic of Finite Fields
Global equilibrium search applied to the unconstrained binary quadratic optimization problem
Optimization Methods & Software
Reoptimization of Weighted Graph and Covering Problems
Approximation and Online Algorithms
A game-theoretic approach to partial clique enumeration
Image and Vision Computing
Proceedings of the 4th Annual International Conference on Wireless Internet
Reactive and dynamic local search for max-clique: Engineering effective building blocks
Computers and Operations Research
An algorithm for optimal winner determination in combinatorial auctions
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
Time-dependent multi-scheduling of multicast
ACM Transactions on Algorithms (TALG)
Aligning Two Genomic Sequences That Contain Duplications
RECOMB-CG '09 Proceedings of the International Workshop on Comparative Genomics
The complexity of base station positioning in cellular networks
Discrete Applied Mathematics
Approximations of weighted independent set and hereditary subset problems
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
On the complexity of approximating colored-graph problems extended abstract
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
The greedier the better: an efficient algorithm for approximating maximum independent set
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
A continuous-based approach for partial clique enumeration
GbRPR'07 Proceedings of the 6th IAPR-TC-15 international conference on Graph-based representations in pattern recognition
Inapproximability results for equations over infinite groups
Theoretical Computer Science
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
PTAS for maximum weight independent set problem with random weights in bounded degree graphs
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Note: Independence in connected graphs
Discrete Applied Mathematics
On the limitations of Greedy mechanism design for truthful combinatorial auctions
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Approximation algorithms for NP-hard optimization problems
Algorithms and theory of computation handbook
A new spectral bound on the clique number of graphs
SSPR&SPR'10 Proceedings of the 2010 joint IAPR international conference on Structural, syntactic, and statistical pattern recognition
On the hardness and inapproximability of optimization problems on power law graphs
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I
A lower bound on independence in terms of degrees
Discrete Applied Mathematics
Short locally testable codes and proofs: a survey in two parts
Property testing
Introduction to testing graph properties
Property testing
Short locally testable codes and proofs: a survey in two parts
Property testing
Introduction to testing graph properties
Property testing
Using the FGLSS-reduction to prove inapproximability results for minimum vertex cover in hypergraphs
Studies in complexity and cryptography
Short locally testable codes and proofs
Studies in complexity and cryptography
Introduction to testing graph properties
Studies in complexity and cryptography
On the computation of some standard distances between probabilistic automata
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
Better inapproximability results for maxclique, chromatic number and min-3lin-deletion
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Greedy approximation via duality for packing, combinatorial auctions and routing
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Approximation algorithms for edge-disjoint paths and unsplittable flow
Efficient Approximation and Online Algorithms
Theoretical Computer Science
New techniques for approximating optimal substructure problems in power-law graphs
Theoretical Computer Science
RecMax: exploiting recommender systems for fun and profit
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
Approximation algorithms and hardness results for shortest path based graph orientations
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
Notions of connectivity in overlay networks
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
The walls have ears: optimize sharing for visibility and privacy in online social networks
Proceedings of the 21st ACM international conference on Information and knowledge management
The clique problem in ray intersection graphs
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
An auction-based MAC protocol for cognitive radio networks
International Journal of Communication Systems
Note: A new lower bound on the independence number of graphs
Discrete Applied Mathematics
Mechanisms for multi-unit combinatorial auctions with a few distinct goods
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
| Hi-index | 0.00 |
The author proves that unless NP=coR, Max Clique is hard to approximate in polynomial time within a factor n1- for any 0. This is done by, for any d0, constructing a proof system for NP which uses d amortized free bits. A central lemma, which might be of independent interest, gives sufficient conditions (in the form of a certain type of agreement) for creating a global function from local functions certain local consistency conditions.