×

zbMATH — the first resource for mathematics

The rectilinear Steiner tree problem is NP-complete. (English) Zbl 0396.05009

MSC:
05C05 Trees
68Q25 Analysis of algorithms and problem complexity
PDF BibTeX XML Cite
Full Text: DOI