One Tree to Rule Them All: Poly-Logarithmic Universal Steiner Tree

Costas Busch, Da Qi Chen, Arnold Filtser +3

A spanning tree $T$ of graph $G$ is a $\rho$-approximate universal Steiner tree (UST) for root vertex $r$ if, for any subset of vertices $S$ containing $r$, the cost of the minimal su…