Garey, M. R.; Johnson, D. S. The rectilinear Steiner tree problem is NP-complete. (English) Zbl 0396.05009 SIAM J. Appl. Math. 32, 826-834 (1977). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 3 ReviewsCited in 200 Documents MSC: 05C05 Trees 68Q25 Analysis of algorithms and problem complexity Keywords:Steiner Tree Problem; Np-Complete; Net Wiring Patterns PDF BibTeX XML Cite \textit{M. R. Garey} and \textit{D. S. Johnson}, SIAM J. Appl. Math. 32, 826--834 (1977; Zbl 0396.05009) Full Text: DOI