93 search results - page 1 / 19 » Sublinear-time approximation of Euclidean minimum spanning t... |
ICALP
2001
Springer
13 years 8 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 ...
CCCG
2007
13 years 5 months ago
2007
In the minimum-cost k-hop spanning tree (k-hop MST) problem, we are given a set S of n points in a metric space, a positive small integer k and a root point r ∈ S. We are intere...
SODA
2003
ACM
13 years 5 months ago
2003
ACM
STOC
2004
ACM
14 years 4 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...
COMPGEOM
2003
ACM
13 years 9 months 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