A tree-based algorithm for distributed mutual exclusion
ACM Transactions on Computer Systems (TOCS)
Compression of correlated bit-vectors
Information Systems
Approximating shallow-light trees
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Improved heuristics for the bounded-diameter minimum spanning tree problem
Soft Computing - A Fusion of Foundations, Methodologies and Applications
Greedy heuristics for the bounded diameter minimum spanning tree problem
Journal of Experimental Algorithmics (JEA)
| Hi-index | 0.00 |
Given a connected, weighted, undirected graph G with n vertices and a positive integer bound D, the problem of computing the lowest cost spanning tree from amongst all spanning trees of the graph containing paths with at most D edges is known to be NP-Hard for 4 ≤ D 4) time. A modified version of this heuristic using a tree-center based approach runs an order faster. A greedy randomized heuristic for the problem runs in O(n3) time and produces better (lower cost) spanning trees on Euclidean benchmark problem instances when the diameter bound is small. This paper presents two novel heuristics that compute low cost diameter-constrained spanning trees in O(n3) and O(n2) time respectively. The performance of these heuristics vis-à-vis the extant heuristics is shown to be better on a wide range of Euclidean benchmark instances used in the literature for the BDMST Problem.