102 search results - page 4 / 21 » Spanning trees with minimum weighted degrees |
98
Voted
IPPS
2003
IEEE
15 years 7 months ago
2003
IEEE
STOC
2000
ACM
15 years 6 months ago
2000
ACM
107
Voted
IPCO
1996
15 years 3 months ago
1996
115
click to vote
NETWORKS
2008
15 years 1 months ago
2008
Given a graph where increasing the weight of an edge has a nondecreasing convex piecewise linear cost, we study the problem of finding a minimum cost increase of the weights so tha...
122
click to vote
STOC
2004
ACM
16 years 2 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...