The 1-steiner tree problem

Steiner Minimal Trees

E. N. Gilbert, H. O. Pollak · SIAM Journal on Applied Mathematics · 1968 · 938 citations

Computing, Computer Science, Combinatorics +8

The Euclidean travelling salesman problem is NP-complete

Christos H. Papadimitriou · Theoretical Computer Science · 1977 · 775 citations

Computing, Computer Science, Mathematics +9

Some NP-complete geometric problems

M. R. Garey, Ron Graham, David Johnson · 1976 · 396 citations

Computing, Computer Science, Mathematics +16

On the Steiner Problem

E. J. Cockayne · Canadian Mathematical Bulletin · 1967 · 93 citations · Full text

Natural Sciences, Mathematics, Geometry +10