Whee!
Paper is submitted to WADS. Eight pages, 4 code listings, no figures, 2 references.
The abstract is as follows:
In this paper, we define the Maximum-Mean Subtree problem on trees, an equivalent reformulation of the Fractional Prize-Collecting Steiner Tree Problem on Trees. We describe an algorithm that solves the Maximum-Mean Subtree problem, and prove that our algorithm runs in O(n) time in the worst case, improving a previous O(n log n) algorithm.
The abstract is as follows:
In this paper, we define the Maximum-Mean Subtree problem on trees, an equivalent reformulation of the Fractional Prize-Collecting Steiner Tree Problem on Trees. We describe an algorithm that solves the Maximum-Mean Subtree problem, and prove that our algorithm runs in O(n) time in the worst case, improving a previous O(n log n) algorithm.