On Strong Graph Partitions and Universal Steiner Trees

Costas Busch, Chinmoy Dutta, Jaikumar Radhakrishnan +2

We study the problem of constructing universal Steiner trees for undirected graphs. Given a graph $G$ and a root node $r$, we seek a single spanning tree $T$ of minimum {\em stretc…