The NP-completeness column: The many limits on approximation
ACM Transactions on Algorithms (TALG)
Approximation algorithms for optimization problems in graphs with superlogarithmic treewidth
Information Processing Letters
Approximating the maximum clique minor and some subgraph homeomorphism problems
Theoretical Computer Science
Finding large cliques in sparse semi-random graphs by simple randomized search heuristics
Theoretical Computer Science
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Dense subgraph problems with output-density conditions
ACM Transactions on Algorithms (TALG)
Approximating Independent Set and Coloring in Random Uniform Hypergraphs
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
SDP-Based Algorithms for Maximum Independent Set Problems on Hypergraphs
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Approximation algorithms for optimization problems in graphs with superlogarithmic treewidth
Information Processing Letters
"Rent-or-buy" scheduling and cost coloring problems
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Paired approximation problems and incompatible inapproximabilities
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Local search with edge weighting and configuration checking heuristics for minimum vertex cover
Artificial Intelligence
Approximating maximum diameter-bounded subgraphs
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Finding a maximum independent set in a sparse random graph
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
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
Reoptimization of some maximum weight induced hereditary subgraph problems
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
The minimum spanning tree problem with conflict constraints and its variations
Discrete Optimization
Streaming and communication complexity of clique approximation
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Graph orientations optimizing the number of light or heavy vertices
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
Maximum cliques in graphs with small intersection number and random intersection graphs
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
SDP-based algorithms for maximum independent set problems on hypergraphs
Theoretical Computer Science
Approximating independent set in perturbed graphs
Discrete Applied Mathematics
Denser than the densest subgraph: extracting optimal quasi-cliques with quality guarantees
Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining
An information complexity approach to extended formulations
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Dense subgraph mining with a mixed graph model
Pattern Recognition Letters
NuMVC: an efficient local search algorithm for minimum vertex cover
Journal of Artificial Intelligence Research
Reoptimization of maximum weight induced hereditary subgraph problems
Theoretical Computer Science
| Hi-index | 0.00 |
We show an algorithm that finds cliques of size (log n/log log n)2 whenever a graph has a clique of size at least n/(log n)b for an arbitrary constant b. This leads to an algorithm that approximates max clique within a factor of O(n(log log n)2/(log n)3), which matches the best approximation ratio known for the chromatic number. The previously best approximation ratio known for max clique was O(n/(log n)2).