Scheduling jobs with fixed start and end times
Discrete Applied Mathematics
A polynomial time approximation algorithm for Dynamic Storage Allocation
Discrete Mathematics
A Strip-Packing Algorithm with Absolute Performance Bound 2
SIAM Journal on Computing
Page replacement for general caching problems
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Algorithms for compile-time memory optimization
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
SIAM Journal on Discrete Mathematics
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Approximating the Throughput of Multiple Machines in Real-Time Scheduling
SIAM Journal on Computing
Approximation Algorithms for Dynamic Storage Allocations
ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
Improved Approximation Algorithms for NMR Spectral Peak Assignment
WABI '02 Proceedings of the Second International Workshop on Algorithms in Bioinformatics
Routing and Admission Control in Networks with Advance Reservations
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
Interval selection: applications, algorithms, and lower bounds
Journal of Algorithms
New hardness results for congestion minimization and machine scheduling
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
New results on web caching with request reordering
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Packet-mode policies for input-queued switches
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Mathematical sciences in the nineties
IBM Journal of Research and Development
Local ratio: A unified framework for approximation algorithms. In Memoriam: Shimon Even 1935-2004
ACM Computing Surveys (CSUR)
Conversion of coloring algorithms into maximum weight independent set algorithms
Discrete Applied Mathematics
A Recursive Greedy Algorithm for Walks in Directed Graphs
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Dependent rounding and its applications to approximation algorithms
Journal of the ACM (JACM)
Real time scheduling with a budget: parametric-search is better than binary search
Information Processing Letters
Algorithmic aspects of bandwidth trading
ACM Transactions on Algorithms (TALG)
An efficient approximation for the generalized assignment problem
Information Processing Letters
Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems
Mathematics of Operations Research
Admission control with advance reservations in simple networks
Journal of Discrete Algorithms
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
Greedy in approximation algorithms
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Optimization problems in multiple-interval graphs
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Exploiting locality: approximating sorting buffers
Journal of Discrete Algorithms
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Elementary approximation algorithms for prize collecting Steiner tree problems
Information Processing Letters
Randomized competitive algorithms for generalized caching
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Fast distributed scheduling via primal-dual
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Approximating the 2-interval pattern problem
Theoretical Computer Science
Approximation Algorithms for 2-Stage Stochastic Scheduling Problems
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
Elementary Approximation Algorithms for Prize Collecting Steiner Tree Problems
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Distributed Approximation of Cellular Coverage
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
A logarithmic approximation for unsplittable flow on line graphs
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Throughput maximization of real-time scheduling with batching
ACM Transactions on Algorithms (TALG)
Approximating maximum weight K-colorable subgraphs in chordal graphs
Information Processing Letters
On Lagrangian Relaxation and Subset Selection Problems
Approximation and Online Algorithms
A Novel Approximate Algorithm for Admission Control
FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
Resource Management in Large Networks
Algorithmics of Large and Complex Networks
The Design of Competitive Online Algorithms via a Primal: Dual Approach
Foundations and Trends® in Theoretical Computer Science
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
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
Time-dependent multi-scheduling of multicast
ACM Transactions on Algorithms (TALG)
Conversion of coloring algorithms into maximum weight independent set algorithms
Discrete Applied Mathematics
Optimization problems in multiple-interval graphs
ACM Transactions on Algorithms (TALG)
Multicommodity demand flow in a tree
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Real-time scheduling with a budget
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Fast distributed algorithms via primal-dual
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
Approximating interval scheduling problems with bounded profits
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Virtual appliance content distribution for a global infrastructure cloud service
INFOCOM'10 Proceedings of the 29th conference on Information communications
Frequency-domain packet scheduling for 3GPP LTE uplink
INFOCOM'10 Proceedings of the 29th conference on Information communications
Minimizing total busy time in parallel scheduling with application to optical networks
Theoretical Computer Science
Bandwidth allocation in cellular networks with multiple interferences
Proceedings of the 6th International Workshop on Foundations of Mobile Computing
Resource allocation with time intervals
Theoretical Computer Science
On the limitations of Greedy mechanism design for truthful combinatorial auctions
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Caching is hard: even in the fault model
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
SIAM Journal on Computing
How well can primal-dual and local-ratio algorithms perform?
ACM Transactions on Algorithms (TALG)
An improved approximation algorithm for resource allocation
ACM Transactions on Algorithms (TALG)
On tree-constrained matchings and generalizations
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
On capacitated set cover problems
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
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
A primal-dual approximation algorithm for min-sum single-machine scheduling problems
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
A truthful mechanism for value-based scheduling in cloud computing
SAGT'11 Proceedings of the 4th international conference on Algorithmic game theory
An O(log k)-competitive algorithm for generalized caching
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
How well can primal-dual and local-ratio algorithms perform?
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Using fractional primal-dual to schedule split intervals with demands
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Improved approximation algorithm for convex recoloring of trees
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
Exploiting locality: approximating sorting buffers
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
Distributed approximation of cellular coverage
Journal of Parallel and Distributed Computing
Pricing on paths: a PTAS for the highway problem
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Secretary problems: laminar matroid and interval scheduling
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Off-line admission control for advance reservations in star networks
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
ACM Transactions on Algorithms (TALG)
Minimizing setup and beam-on times in radiation therapy
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Theoretical Computer Science
On column-restricted and priority covering integer programs
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
Using fractional primal-dual to schedule split intervals with demands
Discrete Optimization
Near-optimal scheduling mechanisms for deadline-sensitive jobs in large computing clusters
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
Distributed algorithms for scheduling on line and tree networks
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
A Primal-Dual Randomized Algorithm for Weighted Paging
Journal of the ACM (JACM)
Randomized Competitive Algorithms for Generalized Caching
SIAM Journal on 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
Combination of parallel machine scheduling and vertex cover
Theoretical Computer Science
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
Scheduling jobs with multiple non-uniform tasks
Euro-Par'13 Proceedings of the 19th international conference on Parallel Processing
A logarithmic approximation for unsplittable flow on line graphs
ACM Transactions on Algorithms (TALG)
A Truthful Mechanism for Value-Based Scheduling in Cloud Computing
Theory of Computing Systems
| Hi-index | 0.01 |
We present a general framework for solving resource allocation and scheduling problems. Given a resource of fixed size, we present algorithms that approximate the maximum throughput or the minimum loss by a constant factor. Our approximation factors apply to many problems, among which are: (i) real-time scheduling of jobs on parallel machines, (ii) bandwidth allocation for sessions between two endpoints, (iii) general caching, (iv) dynamic storage allocation, and (v) bandwidth allocation on optical line and ring topologies. For some of these problems we provide the first constant factor approximation algorithm. Our algorithms are simple and efficient and are based on the local-ratio technique. We note that they can equivalently be interpreted within the primal-dual schema.