Discrete Applied Mathematics · 1998 · 59 citations · 11 references
ComputingComputer ScienceMathematicsAlgorithmsOptimizationTheory Of ComputationApproximation AlgorithmsCombinatorial OptimizationGraph AlgorithmsDeletion AlgorithmsDeletions
11
A Greedy Heuristic for the Set-Covering Problem
Vašek Chvátal · Mathematics of Operations Research · 1979 · 2.6K citations
Some simplified NP-complete graph problems
M. R. Garey, David S. Johnson, Larry Stockmeyer · Theoretical Computer Science · 1976 · 2.1K citations
Proof verification and hardness of approximation problems
Sanjeev Arora, Carsten Lund, R. Motwani et al. · 1992 · 744 citations