Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree.
Davide BilòLuciano GualàGuido ProiettiPublished in: Algorithmica (2014)
Keyphrases
- spanning tree
- minimum cost
- edge disjoint
- minimum total cost
- minimum spanning tree
- lowest cost
- undirected graph
- minimum spanning trees
- approximation algorithms
- minimum weight
- np hard
- routing algorithm
- root node
- edge weights
- routing problem
- social networks
- image segmentation
- bayesian networks
- weighted graph
- network topology
- directed graph
- routing protocol
- graph cuts
- evolutionary algorithm