Brief Annoucement: Distributed Swap Edges Computation for Minimum Routing Cost Spanning Trees.
Linda PagliGiuseppe PrencipePublished in: OPODIS (2009)
Keyphrases
- spanning tree
- minimum cost
- edge disjoint
- minimum total cost
- minimum spanning tree
- undirected graph
- lowest cost
- minimum spanning trees
- np hard
- distributed systems
- approximation algorithms
- cooperative
- distributed environment
- network nodes
- graph cuts
- communication cost
- routing decisions
- service requirements
- multi agent
- load distribution
- load balance
- weighted graph
- routing algorithm
- mobile agents
- peer to peer