A polynomial time approximation algorithm for Dynamic Storage Allocation
Discrete Mathematics
Bandwidth allocation with preemption
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Efficient on-line call control algorithms
Journal of Algorithms
Approximating the throughput of multiple machines under real-time scheduling
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Algorithms for compile-time memory optimization
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
A unified approach to approximating resource allocation and scheduling
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A Coloring Algorithm for Interval Graphs
MFCS '89 Proceedings on Mathematical Foundations of Computer Science 1989
Approximation Algorithms for Dynamic Storage Allocations
ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
Improved Approximation Algorithms for Resource Allocation
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Evaluating the Local Ratio Algorithm for Dynamic Storage Allocation
ALENEX '02 Revised Papers from the 4th International Workshop on Algorithm Engineering and Experiments
Resource allocation in bounded degree trees
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Resource allocation with time intervals
Theoretical Computer Science
An improved approximation algorithm for resource allocation
ACM Transactions on Algorithms (TALG)
A constant factor approximation algorithm for the storage allocation problem: extended abstract
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
| Hi-index | 0.01 |
The problem we consider is motivated by allocating bandwidth slots to communication requests on a satellite channel under real time constraints. Accepted requests must be scheduled on nonintersecting rectangles in the time/bandwidth Cartesian space with the goal of maximizing the benefit obtained from accepted requests. This problem turns out to be equal to the maximization version of the well known Dynamic Storage Allocation problem when storage size is limited and requests must be accommodated within a prescribed time interval. We present constant approximation algorithms for the problem introduced in this paper using as a basic step the solution of a fractional Linear Programming formulation. This problem has been independently studied by Bar-Noy et al [BNBYF+00] with different techniques. Our approach gives an improved approximation ratio for the problem.