A Simple and Efficient 2-Approximation Algorithm for the Maximum-Leaf Spanning Tree Problem

We present a simple and efficient O(m)-time 2-approximation algorithm for the maximum-leaf spanning tree problem, which is NP-complete even for planar graphs with maximum degree 4.