Approximating Spanning Trees with Inner Nodes Cost.

Rudolf Fleischer Qi Ge Jian Li Shijun Tian Haitao Wang

Published in: PDCAT (2005)

Keyphrases

spanning tree
minimum cost
root node
minimum spanning tree
minimum total cost
edge disjoint
undirected graph
np hard
lowest cost
approximation algorithms
minimum spanning trees
leaf nodes
edge weights
weighted graph
depth first search
high cost
total cost
shortest path