A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs.

Paul S. Bonsma, Florian Zickfeld

Browse the full WG paper archive.