Dynamic Programming for Minimum Steiner Trees

The Rectilinear Steiner Tree Problem is $NP$-Complete

M. R. Garey, David S. Johnson · SIAM Journal on Applied Mathematics · 1977 · 1.1K citations

Mathematical Programming, Engineering, Graph Theory +15

The steiner problem in graphs

Stuart E. Dreyfus, Robert A. Wagner · Networks · 1971 · 687 citations

Engineering, Network Analysis, Computational Complexity +17

On Steiner Minimal Trees with Rectilinear Distance

F. K. Hwang · SIAM Journal on Applied Mathematics · 1976 · 423 citations

Mathematical Programming, Geometric Graph Theory, Engineering +13

On exact solutions for the rectilinear Steiner tree problem

Ulrich Fößmeier, Michael Kaufmann · 1997 · 14 citations

Mathematical Programming, Geometric Graph Theory, Engineering +7

Optimal Rectilinear Steiner Minimal Trees in O (n 2 2.62 n ) Time.

Joseph L. Ganley, James P. Cohoon · Canadian Conference on Computational Geometry · 1994 · 12 citations

Engineering, Graph Theory, Extremal Graph Theory +8