Journal of Combinatorial Optimization · 2011 · 67 citations · 25 references
Natural SciencesComputer ScienceMathematicsAlgorithmsCombinatoricsOptimizationCombinatorial OptimizationEvolutionary OptimizationGenetic AlgorithmsGlobal OptimizationInteger ProgrammingMetaheuristic OptimizationClique AlgorithmsCliquesTabu Search
25
Proof verification and the hardness of approximation problems
Sanjeev Arora, Carsten Lund, Rajeev Motwani et al. · Journal of the ACM · 1998 · 1.4K citations · Full text
Clique is hard to approximate within n1−ε
Johan Håstad · Acta Mathematica · 1999 · 1.4K citations · Full text
Proof verification and hardness of approximation problems
Sanjeev Arora, Carsten Lund, R. Motwani et al. · 1992 · 744 citations