Hsuliang Chang

  • Citations Per Year
Learn More
The Extended Tree Knapsack Problem(ETKP) is a generalized version of the Tree Knapsack Problem where an arbitrary nonlinear traac-ow cost is imposed. This problem can be solved by the straightforward \bottom-up" approach with a time complexity of O(nH 2), where n is the number of nodes in the tree, and H is the knapsack capacity. In this paper, we show that(More)
  • 1