Resource Allocation in Bounded Degree Trees

We study the bandwidth allocation problem (bap) in bounded degree trees. In this problem we are given a tree and a set of connection requests. Each request consists of a path in the tree, a bandwidth requirement, and a weight. Our goal is to find a maximum weight subset S of requests such that, for every edge e, the total bandwidth of requests in S

• Type: Conference
• Year: 2006
• Where: ESA
• Authors: Reuven Bar-Yehuda, Michael Beder, Yuval Cohen, Dror Rawitz
• Keywords: Algorithms, Bandwidth Allocation Problem, Connection Requests, ESA 2006, Maximum Weight Subset