A distributed algorithm for constructing a minimum diameter spanning tree.
Marc BuiFranck ButelleChristian LavaultPublished in: J. Parallel Distributed Comput. (2004)
Keyphrases
- spanning tree
- detection algorithm
- learning algorithm
- minimum spanning tree
- dynamic programming
- np hard
- computational complexity
- preprocessing
- worst case
- minimum cost
- simulated annealing
- genetic algorithm
- cost function
- search space
- distributed systems
- expectation maximization
- ant colony optimization
- graph structure
- k means
- optimal solution
- minimum weight