David S. Johnson
1945 · 7 obras en el catálogo
Obras
The shortest path problem

Network flows and matching

Data structures, near neighbor searches, and methodology

Cliques, Coloring, and Satisfiability: Second Dimacs Implementation Challenge, October 11-13, 1993 (Dimacs Series in Discrete Mathematics and Theoretical Computer Science)

Discrete algorithms and complexity
Near-optimal bin packing algorithms
