Minimum-Cost Spanning Tree as a Path-Finding Problem.

Bruce M. Maggs Serge A. Plotkin

Published in: Inf. Process. Lett. (1988)

Keyphrases

path finding
spanning tree
minimum cost
np hard
path planning
approximation algorithms
heuristic search
minimum spanning tree
search algorithm
network flow problem
network flow
minimum spanning trees
undirected graph
hill climbing
minimum weight
optimal path
edge weights
mobile robot
search space