A distributed approximation algorithm for the minimum degree minimum weight spanning trees
Christian LavaultMario Valencia-PabonPublished in: CoRR (2006)
Keyphrases
- spanning tree
- minimum weight
- minimum spanning tree
- undirected graph
- learning algorithm
- np hard
- edge disjoint
- optimal solution
- computational complexity
- randomized algorithm
- particle swarm optimization
- minimum cost
- maximum cardinality
- greedy heuristic
- dynamic programming
- average case
- convergence rate
- approximation algorithms
- times faster
- segmentation algorithm
- simulated annealing
- worst case
- probabilistic model
- objective function