Scheduling jobs with fixed start and end times
Discrete Applied Mathematics
A faster strongly polynomial minimum cost flow algorithm
Operations Research
A unified approach to approximating resource allocation and scheduling
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Off-line admission control for general scheduling problems
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
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
Approximation Algorithms for the Unsplittable Flow Problem
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
On rectangle packing: maximizing benefits
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
A quasi-PTAS for unsplittable flow on line graphs
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
A fixed-parameter tractability result for multicommodity demand flow in trees
Information Processing Letters
Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems
Mathematics of Operations Research
Multicommodity demand flow in a tree and packing integer programs
ACM Transactions on Algorithms (TALG)
Resource allocation in bounded degree trees
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
A logarithmic approximation for unsplittable flow on line graphs
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Max-Weight Integral Multicommodity Flow in Spiders and High-Capacity Trees
Approximation and Online Algorithms
Online allocation of display advertisements subject to advanced sales contracts
Proceedings of the Third International Workshop on Data Mining and Audience Intelligence for Advertising
Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Resource Minimization Job Scheduling
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
A fixed-parameter tractability result for multicommodity demand flow in trees
Information Processing Letters
Multicommodity demand flow in a tree
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Resource allocation with time intervals
Theoretical Computer Science
How well can primal-dual and local-ratio algorithms perform?
ACM Transactions on Algorithms (TALG)
A Freight Service Design Problem for a Railway Corridor
Transportation Science
Submodular function maximization via the multilinear relaxation and contention resolution schemes
Proceedings of the forty-third annual ACM symposium on Theory of computing
An improved approximation algorithm for resource allocation
ACM Transactions on Algorithms (TALG)
Scheduling resources for throughput maximization
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Pricing on paths: a PTAS for the highway problem
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Distributed algorithms for scheduling on line and tree networks
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Online optimization of busy time on parallel machines
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
Constant integrality gap LP formulations of unsplittable flow on a path
IPCO'13 Proceedings of the 16th international conference on Integer Programming and Combinatorial Optimization
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
Uncommon Dantzig-Wolfe Reformulation for the Temporal Knapsack Problem
INFORMS Journal on Computing
Scheduling jobs with multiple non-uniform tasks
Euro-Par'13 Proceedings of the 19th international conference on Parallel Processing
| Hi-index | 0.00 |
We study the problem of finding a most profitable subset of n given tasks, each with a given start and finish time as well as profit and resource requirement, that at no time exceeds the quantity B of available resource. We show that this NP-hard Resource Allocation problem can be (1/2-驴)-approximated in polynomial time, which improves upon earlier approximation results for this problem, the best previously published result being a 1/4-approximation.We also give a simpler and faster 1/3-approximation algorithm.