A Steiner tree is an undirected graph G=(V,E) consisting of a set of edges E and a set of nodes V. Given a subset T of V, a Steiner tree is a tree containing all the nodes in T. From the definition, it is clear that a Steiner tree is a universal tree when T=V.

- The [[Minimum Steiner Tree]] problem is a loosening of the [[minimum area tree]] problem so that not all vertices need to be connected.

This page is auto-translated from /nishio/シュタイナー木 using DeepL. If you looks something interesting but the auto-translated English is not good enough to understand it, feel free to let me know at @nishio_en. I’m very happy to spread my thought to non-Japanese readers.