Minimizing maximum response time in scheduling broadcasts
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Broadcast scheduling: when fairness is fine
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Dependent Rounding in Bipartite Graphs
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Algorithms for Minimizing Response Time in Broadcast Scheduling
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
A maiden analysis of Longest Wait First
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
A maiden analysis of longest wait first
ACM Transactions on Algorithms (TALG)
A robust maximum completion time measure for scheduling
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Improved approximation algorithms for broadcast scheduling
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
ACM SIGACT News
Dependent rounding and its applications to approximation algorithms
Journal of the ACM (JACM)
Pull-based data broadcast with dependencies: be fair to users, not to items
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Broadcast scheduling: algorithms and complexity
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
A note on on-line broadcast scheduling with deadlines
Information Processing Letters
Online scheduling to minimize the maximum delay factor
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
An online scalable algorithm for average flow time in broadcast scheduling
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Better scalable algorithms for broadcast scheduling
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Broadcast scheduling: Algorithms and complexity
ACM Transactions on Algorithms (TALG)
Off-line algorithms for minimizing total flow time in broadcast scheduling
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Online scalable scheduling for the lk-norms of flow time without conservation of work
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Longest wait first for broadcast scheduling [extended abstract]
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
Customized newspaper broadcast: data broadcast with dependencies
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
An online scalable algorithm for average flow time in broadcast scheduling
ACM Transactions on Algorithms (TALG)
Brief announcement: online batch scheduling for flow objectives
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
A segmentation approach for file broadcast scheduling
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
We consider the problem of approximating the minimum average response time in on-demand data broadcasting systems. The best approximation factors known for this problem involve resource augmentation. We provide the first non-trivial approximation factors in the absence of resource augmentation, achieving an additive O(√n)-approximation, where n is the number of distinct pages. Our result can be extended, for any ε 0, to a (1 + ε)-speed, additive O(1/ε)-approximation algorithm. Prior to our work, no non-trivial approximation factor was known for the case of ε