Optimal time-critical scheduling via resource augmentation (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Scheduling on-demand broadcasts: new metrics and algorithms
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Minimizing service and operation costs of periodic scheduling
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
The data broadcast problem with non-uniform transmission times
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Polynomial-time approximation scheme for data broadcast
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Minimizing maximum response time in scheduling broadcasts
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Speed is as powerful as clairvoyance
Journal of the ACM (JACM)
Broadcast scheduling: when fairness is fine
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Approximating the single source unsplittable min-cost flow problem
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Broadcast scheduling: when fairness is fine
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Algorithms for Minimizing Response Time in Broadcast Scheduling
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
A Comparison of Multicast Pull Models
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
A maiden analysis of Longest Wait First
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Scheduling broadcasts with deadlines
Theoretical Computer Science - Special papers from: COCOON 2003
Approximating the average response time in broadcast scheduling
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Minimum-cost single-source 2-splittable flow
Information Processing Letters
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
Implementing approximation algorithms for the single-source unsplittable flow problem
Journal of Experimental Algorithmics (JEA)
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
Single source multiroute flows and cuts on uniform capacity networks
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
On the approximation of the single source k-splittable flow problem
Journal of Discrete Algorithms
Improved on-line broadcast scheduling with deadlines
Journal of Scheduling
Online scheduling to minimize the maximum delay factor
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Minimum-cost single-source 2-splittable flow
Information Processing Letters
Scheduling broadcasts with deadlines
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
WEA'03 Proceedings of the 2nd international conference on Experimental and efficient 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
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
Improved on-line broadcast scheduling with deadlines
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
On broadcast scheduling with limited energy
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Longest wait first for broadcast scheduling [extended abstract]
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
Equivalence of two linear programming relaxations for broadcast scheduling
Operations Research Letters
Hi-index | 0.01 |
We consider the version of broadcast scheduling where a server can transmit one message of a given set at each time-step, answering previously made requests for that message. The goal is to minimize the average response time if the amount of requests is known in advance for each time-step and message. We prove that this problem is NP-hard, thus answering an open question stated by Kalyanasundaram, Pruhs and Velauthapillai (Proceedings of ESA 2000, LNCS 1879, 2000, pp. 290-301). Furthermore, we present an approximation algorithm that is allowed to send several messages at once. Using 6 channels for transmissions, the algorithm achieves an average response time that is at least as good as the optimal solution using one channel. The best previous approximation algorithm achieved ratio 1.5 with 6 channels and reached ratio 1 only in the case where there are as many channels as messages.From the NP-hardness of broadcast scheduling we derive a new inapproximability result of (2-ε, 1) for the (congestion,cost) bicriteria version of the single source unsplittable min-cost flow problem, for arbitrary ε 0. The result holds even in the often considered case where the maximum demand is less than or equal to the minimum edge capacity (dmax ≤ umin), a case for which an algorithm with ratio (3, 1) was presented by Skutella.