Optimal Algorithms for Finding the Longest Path with Length and Sum Constraints in a Tree

摘要

Let T be a tree in which every edge is associated with a real number. The sum of a path in T is the sum of the numbers associated with the edges of the path and its length is the number of the edges in it. For two positive integers L_1 < L_2 and two real numbers S_1