206 search results - page 4 / 42 » A distributed approximation algorithm for the minimum degree... |
SIAMCOMP
2000
13 years 7 months ago
2000
This paper presents a lower bound of (D + n/ log n) on the time required for the distributed construction of a minimum-weight spanning tree (MST) in weighted n-vertex networks of ...
DC
2008
13 years 7 months ago
2008
STOC
2004
ACM
14 years 8 months ago
2004
ACM
In this paper we present a sublinear time (1+ )-approximation randomized algorithm to estimate the weight of the minimum spanning tree of an n-point metric space. The running time...
CIAC
2000
Springer
13 years 12 months ago
2000
Springer
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to ...
COMPGEOM
2003
ACM
14 years 27 days ago
2003
ACM
Let τK be the worst-case (supremum) ratio of the weight of the minimum degree-K spanning tree to the weight of the minimum spanning tree, over all finite point sets in the Eu