Max-leaves spanning tree is APX-hard for cubic graphs.

Published in: J. Discrete Algorithms (2012)

Keyphrases

spanning tree
minimum spanning tree
minimum cost
undirected graph
edge disjoint
minimum spanning trees
approximation algorithms
weighted graph
minimum weight
edge weights
root node
special case
b spline
minimum total cost
leaf nodes