Abstract: In this talk we will define the maximized average tree pruning problem, we will describe the pitfalls in solving the problem, and we will finally describe our algorithm which has worst-case O(n log2n) running time.
This is a joint work of Josiah Carlson and David Eppstein.