Garey, M. R.; Graham, R. L.; Johnson, D. S. The complexity of computing Steiner minimal trees. (English) Zbl 0399.05023 SIAM J. Appl. Math. 32, 835-859 (1977). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 2 ReviewsCited in 117 Documents MSC: 05C05 Trees 05-04 Software, source code, etc. for problems pertaining to combinatorics 68Q25 Analysis of algorithms and problem complexity Keywords:Computing Steiner Minimal Trees; Complexity PDF BibTeX XML Cite \textit{M. R. Garey} et al., SIAM J. Appl. Math. 32, 835--859 (1977; Zbl 0399.05023) Full Text: DOI OpenURL