Annals of Operations Research · 2000 · 421 citations · 26 references
Natural SciencesComputer ScienceMathematicsAlgorithmsOptimizationSet TheoryApproximation AlgorithmsBranch And BoundCombinatorial Set TheoryInteger ProgrammingSet CoverSet Cover ProblemSet Covering Problem
26
The Traveling-Salesman Problem and Minimum Spanning Trees
Michael Held, Richard M. Karp · Operations Research · 1970 · 1.4K citations
On the hardness of approximating minimization problems
Carsten Lund, Mihalis Yannakakis · Journal of the ACM · 1994 · 890 citations · Full text