Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree.
Davide BilòLuciano GualàGuido ProiettiPublished in: MFCS (2010)
Keyphrases
- spanning tree
- minimum cost
- edge disjoint
- minimum total cost
- minimum spanning tree
- lowest cost
- minimum spanning trees
- minimum weight
- undirected graph
- np hard
- graph cuts
- approximation algorithms
- edge weights
- routing protocol
- total cost
- routing problem
- evolutionary algorithm
- leaf nodes
- input image
- routing algorithm
- shortest path