628 search results - page 29 / 126 » Approximation Algorithms for Quickest Spanning Tree Problems |
ISAAC
1993
Springer
15 years 7 months ago
1993
Springer
120
click to vote
SODA
2004
ACM
15 years 4 months ago
2004
ACM
We consider the problem of finding a sparse set of edges containing the minimum spanning tree (MST) of a random subgraph of G with high probability. The two random models that we ...
WG
2001
Springer
15 years 7 months ago
2001
Springer
112
Voted
ISAAC
2001
Springer
15 years 7 months ago
2001
Springer
