STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Approximating the minimum-degree Steiner tree to within one of optimal
SODA selected papers from the third annual ACM-SIAM symposium on Discrete algorithms
Introduction to distributed algorithms
Introduction to distributed algorithms
A Distributed Algorithm for Minimum-Weight Spanning Trees
ACM Transactions on Programming Languages and Systems (TOPLAS)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
What would edmonds do? augmenting paths and witnesses for degree-bounded MSTs
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Self-stabilizing minimum degree spanning tree within one from the optimal degree
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
Fischer proposes in [T. Fischer, Optimizing the degree of minimum weight spanning trees, Technical Report 93-1338, Department of Computer Science, Cornell University, Ithaca, NY, USA, 1993] a sequential algorithm to compute a minimum weight spanning tree of maximum degree at most b@D^*+@?log"bn@? in time On^4^+^1^/^l^n^b for any constant b1, where @D^* is the maximum degree value of an optimal solution and n is the number of nodes in the network. In the present paper, we propose a distributed version of Fischer's sequential algorithm with time complexity O@Dn^2^+^1^/^l^n^b, requiring On^3^+^1^/^l^n^b messages and O(n) space per node, where @D is the maximum degree of an initial minimum weight spanning tree.