Resource allocation in bounded degree trees

Authors:
Reuven Bar-Yehuda;Michael Beder;Yuval Cohen;Dror Rawitz
Affiliations:
Department of Computer Science, Technion, Haifa, Israel;Department of Computer Science, Technion, Haifa, Israel;Department of Computer Science, Technion, Haifa, Israel;Caesarea Rothschild Institute, University of Haifa, Haifa, Israel
Venue:
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Year:
2006

Citing 10
Cited 0

Scheduling jobs with fixed start and end times

Discrete Applied Mathematics
A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem

SIAM Journal on Discrete Mathematics
Bandwidth Allocation with Preemption

SIAM Journal on Computing
A unified approach to approximating resource allocation and scheduling

Journal of the ACM (JACM)
Improved Approximation Algorithms for Resource Allocation

Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Approximation Algorithms for the Unsplittable Flow Problem

APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
Approximation Algorithms for Bandwidth and Storage Allocation Problems under Real Time Constraints

FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
OPT Versus LOAD in Dynamic Storage Allocation

SIAM Journal on Computing
Admission Control in Networks with Advance Reservations

Algorithmica
Multicommodity demand flow in a tree

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming

Quantified Score

Hi-index	0.01

Visualization

Abstract

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 whose path contains e is at most 1. We also consider the storage allocation problem (SAP), in which it is also required that every request in the solution is given the same contiguous portion of the resource in every edge in its path. We present a deterministic approximation algorithm for BAP in bounded degree trees with ratio (2√e-1)/√e-1 +epsiv;