A fast algorithm for computing minimum routing cost spanning trees.

Rui Campos Manuel Ricardo

Published in: Comput. Networks (2008)

Keyphrases

spanning tree
minimum cost
edge disjoint
minimum total cost
lowest cost
minimum spanning tree
minimum spanning trees
np hard
approximation algorithms
depth first search
routing algorithm
weighted graph
shortest path
undirected graph
markov chain
routing problem
routing decisions
high cost
total cost
graphical models