Login / Signup
A distributed approximation algorithm for the minimum degree minimum weight spanning trees.
Christian Lavault
Mario Valencia-Pabon
Published in:
J. Parallel Distributed Comput. (2008)
Keyphrases
</>
spanning tree
minimum weight
minimum spanning tree
edge disjoint
minimum cost
undirected graph
dynamic programming
np hard
computational complexity
particle swarm optimization
greedy heuristic
learning algorithm
optimal solution
objective function
weighted graph
worst case
search space
multiscale