Theoretical Computer Science · 1980 · 49 citations · 7 references
Natural SciencesComputer ScienceAlgorithmsOptimizationTheory Of ComputationCombinatorial OptimizationConstrained OptimizationConvex OptimizationDiscrete OptimizationInteger ProgrammingOptimization TheoryCompletenessCompleteness ResultsEnumerative AlgorithmsNp-complete ProblemsNp-completeness
7
`` Strong '' NP-Completeness Results
M. R. Garey, David Johnson · Journal of the ACM · 1978 · 657 citations · Full text
Algorithms for Scheduling Independent Tasks
Sartaj Sahni · Journal of the ACM · 1976 · 593 citations · Full text
On Isomorphisms and Density of $NP$ and Other Complete Sets
L. Berman, Juris Hartmanis · SIAM Journal on Computing · 1977 · 460 citations
Approximation algorithms for combinatorial problems
David S. Johnson · 1973 · 267 citations