A distributed approximation algorithm for the minimum degree minimum weight spanning trees
- 1 February 2008
- journal article
- Published by Elsevier BV in Journal of Parallel and Distributed Computing
- Vol. 68 (2), 200-208
- https://doi.org/10.1016/j.jpdc.2007.07.005
Abstract
No abstract availableThis publication has 4 references indexed in Scilit:
- Speeding up Approximation Algorithms for NP-Hard Spanning Forest Problems by Multi-objective OptimizationLecture Notes in Computer Science, 2006
- THE FIRST APPROXIMATED DISTRIBUTED ALGORITHM FOR THE MINIMUM DEGREE SPANNING TREE PROBLEM ON GENERAL GRAPHSInternational Journal of Foundations of Computer Science, 2004
- Approximating the Minimum-Degree Steiner Tree to within One of OptimalJournal of Algorithms, 1994
- A Distributed Algorithm for Minimum-Weight Spanning TreesACM Transactions on Programming Languages and Systems, 1983