We study the problem of finding a spanning tree with maximum number of leaves. We present a simple, linear time 2-approximation algorithm for this problem, improving on the previous best known algorithm for the problem, which has approximation ratio 3.
['Roberto Solis-Oba', 'Paul S. Bonsma', 'Stefanie Lowski']
A 2-Approximation Algorithm for Finding a Spanning Tree with Maximum Number of Leaves