# On Strong Graph Partitions and Universal Steiner Trees

(2011)

Cited by: 0|Views11

Abstract:

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 stretch}, where the stretch of $T$ is defined to be the maximum ratio, over all terminal sets $X$, of the cost of the minimal sub-tree $T_X$ of $T$ that connects \$X...More

Code:

Data:

ZH
Full Text
Bibtex
0

Tags