36 search results - page 1 / 8 » Parallel Minimum Spanning Tree Heuristic for the steiner pro... |
ICPADS
2007
IEEE
14 years 1 months ago
2007
IEEE
Given an undirected graph with weights associated with its edges, the Steiner tree problem consists of finding a minimum weight subtree spanning a given subset of (terminal) nodes...
CIAC
2000
Springer
13 years 11 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 ...
GECCO
2004
Springer
14 years 24 days ago
2004
Springer
In this paper, we consider a variation of the Euclidean Steiner Tree Problem in which the space underlying the set of nodes has a specified non-uniform cost structure. This proble...
IPPS
2003
IEEE
14 years 21 days ago
2003
IEEE
SAC
2003
ACM
14 years 20 days ago
2003
ACM
Given a connected, weighted, undirected graph G and a bound D, the bounded-diameter minimum spanning tree problem seeks a spanning tree on G of lowest weight in which no path betw...