Max-Leaves Spanning Tree is APX-hard for Cubic Graphs

Published in: CoRR (2009)

Keyphrases

spanning tree
minimum spanning tree
minimum spanning trees
minimum cost
edge disjoint
weighted graph
undirected graph
approximation algorithms
minimum weight
edge weights
minimum total cost
genetic algorithm
upper bound
lower bound
computational complexity
objective function
decision trees
lowest cost