Split and Join: Strong Partitions and Universal Steiner Trees for Graphs

foundations of computer science, Volume abs/1111.4766, 2012, Pages 81-90.

Cited by: 4|Views8
EI WOS

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:

Full Text
Bibtex