42 search results - page 1 / 9 » Approximating Minimum Max-Stretch spanning Trees on unweight... |
SODA
2004
ACM
13 years 5 months ago
2004
ACM
Given a graph G and a spanning tree T of G, we say that T is a tree t-spanner of G if the distance between every pair of vertices in T is at most t times their distance in G. The p...
ICALP
2001
Springer
13 years 9 months ago
2001
Springer
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...
APPROX
2007
Springer
13 years 10 months ago
2007
Springer
A star graph is a tree of diameter at most two. A star forest is a graph that consists of node-disjoint star graphs. In the spanning star forest problem, given an unweighted graph ...
IPPS
2003
IEEE
13 years 9 months ago
2003
IEEE
STOC
2007
ACM
14 years 4 months ago
2007
ACM
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...