230 search results - page 13 / 46 » Minimum Spanning Tree Problem with Label Selection |
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. We consider the minimum spanning tree problem in a setting where information about the edge weights of the given graph is uncertain. Initially, for each edge e of the gra...
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 ...
OPODIS
2001
13 years 8 months ago
2001
In their pioneering paper [4], Gallager et al. introduced a distributed algorithm for constructing the minimum-weight spanning tree (MST), many authors have suggested ways to enhan...
ICCNMC
2005
Springer
14 years 1 months ago
2005
Springer
This study deals with the topology discovery for the capacitated minimum spanning tree network. The problem is composed of finding the best way to link nodes to a source node and, ...
COMPGEOM
2000
ACM
13 years 12 months ago
2000
ACM
We present an (1+ε)-approximation algorithm for computing the minimum-spanning tree of points in a planar arrangement of lines, where the metric is the number of crossings betwee...