Mathematical Programming · 2004 · 81 citations · 36 references
Natural SciencesComputer ScienceMathematicsAlgorithmsCombinatoricsDiscrete MathematicsApproximation AlgorithmsCombinatorial OptimizationDiscrete OptimizationInteger ProgrammingDisjoint PathsDisjoint Paths ProblemEnumerative AlgorithmsInteger Programming RelaxationsPacking Problems
36
Clique is hard to approximate within n1−ε
Johan Håstad · Acta Mathematica · 1999 · 1.4K citations · Full text
On the ratio of optimal integral and fractional covers
László Lovász · Discrete Mathematics · 1975 · 1.1K citations
On the Computational Complexity of Combinatorial Problems
Richard M. Karp · Networks · 1975 · 712 citations