David S. Johnson

Publications176
h-index72
Citations83,298
Highly Influential Citations6,794
Claim Author Page
Author pages are created from data sourced from our academic publisher partnerships and public sources.

Recommended Authors

  • C. Papadimitriou
  • 560 Publications • 61,588 Citations
  • M. Garey
  • 105 Publications • 78,486 Citations
  • M. Yannakakis
  • 292 Publications • 32,345 Citations
  • E. Coffman
  • 285 Publications • 14,001 Citations
  • Publications
  • Influence
Computers and Intractability: A Guide to the Theory of NP-Completeness
Horn formulae play a prominent role in artificial intelligence and logic programming. In this paper we investigate the problem of optimal compression of propositional Horn production rule knowledge…
Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran
Approximation algorithms for combinatorial problems
TLDR
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.
View on ACM
Some Simplified NP-Complete Graph Problems
View via Publisher
Unit disk graphs
View via Publisher
Approximation algorithms for bin packing: a survey
Near-optimal bin packing algorithms
How easy is local search?
View on IEEE
Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
TLDR
This work examines the performance of a number of simple algorithms which obtain “good” placements and shows that neither the first-fit nor the best-fit algorithm will ever use more than $\frac{17}{10}L^ * + 2$ bins.
View via Publisher
The Traveling Salesman Problem: A Case Study in Local Optimization
TLDR
This chapter discusses how various approaches to combinatorial optimization have been adapted to the TSP and evaluates their relative success in this perhaps atypical domain from both a theoretical and an experimental point of view.
...
...