D
David S. Johnson
Researcher at AT&T Labs
Publications - 180
Citations - 77615
David S. Johnson is an academic researcher from AT&T Labs. The author has contributed to research in topics: Approximation algorithm & Bin packing problem. The author has an hindex of 73, co-authored 176 publications receiving 74959 citations. Previous affiliations of David S. Johnson include University of Waterloo & Bell Labs.
Papers
More filters
Book
Computers and Intractability: A Guide to the Theory of NP-Completeness
TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
Journal ArticleDOI
Approximation algorithms for combinatorial problems
TL;DR: For the problem of finding the maximum clique in a graph, no algorithm has been found for which the ratio does not grow at least as fast as n^@e, where n is the problem size and @e>0 depends on the algorithm.
Journal ArticleDOI
The Complexity of Flowshop and Jobshop Scheduling
TL;DR: The results are strong in that they hold whether the problem size is measured by number of tasks, number of bits required to express the task lengths, or by the sum of thetask lengths.
Journal ArticleDOI
Some simplified NP-complete graph problems
TL;DR: This paper shows that a number of NP - complete problems remain NP -complete even when their domains are substantially restricted, and determines essentially the lowest possible upper bounds on node degree for which the problems remainNP -complete.
A guide to the theory of np-completeness
TL;DR: This is the second edition of a quarterly column the purpose of which is to provide a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in the authors' book ‘‘Computers and Intractability: A Guide to the Theory of NP-Completeness’’.