Computing a Diameter-Constrained Minimum Spanning Tree in Parallel
CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity
Proceedings of the 2003 ACM symposium on Applied computing
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Improved heuristics for the bounded-diameter minimum spanning tree problem
Soft Computing - A Fusion of Foundations, Methodologies and Applications
SAINT '08 Proceedings of the 2008 International Symposium on Applications and the Internet
Approximating k-hop minimum-spanning trees
Operations Research Letters
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Novel Deterministic Heuristics for Building Minimum Spanning Trees with Constrained Diameter
PReMI '09 Proceedings of the 3rd International Conference on Pattern Recognition and Machine Intelligence
Improvement of bounded-diameter MST instances with hybridization of multi-objective EA
Proceedings of the 2011 International Conference on Communication, Computing & Security
Efficient execution plans for distributed skyline query processing
Proceedings of the 14th International Conference on Extending Database Technology
Hi-index | 0.00 |
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 minimum weight among the trees in which no path between two vertices contains more than D edges. In Prim's algorithm, the diameter of the growing spanning tree can always be known, so it is a good starting point from which to develop greedy heuristics for the bounded diameter problem. Abdalla, Deo, and Gupta described such an algorithm. It imitates Prim's algorithm but avoids edges whose inclusion in the spanning tree would violate the diameter bound. Running the algorithm from one start vertex requires time that is O(n3). A modification of this approach uses the start vertex as the center of the spanning tree (if D is even) or as one of the two center vertices (if D is odd). This yields a simpler algorithm whose time is O(n2). A further modification chooses each next vertex at random rather than greedily, though it still connects each vertex to the growing tree with the lowest-weight feasible edge. On Euclidean problem instances with small diameter bounds, the randomized heuristic is superior to the two fully greedy algorithms, though its advantage fades as the diameter bound grows. On instances whose edge weights have been chosen at random, the fully greedy algorithms outperform the randomized heuristic.