102 search results - page 4 / 21 » Spanning trees with minimum weighted degrees |
IPPS
2003
IEEE
14 years 17 days ago
2003
IEEE
STOC
2000
ACM
13 years 11 months ago
2000
ACM
IPCO
1996
13 years 8 months ago
1996
NETWORKS
2008
13 years 7 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...
STOC
2004
ACM
14 years 7 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...