Algorithms for Minimizing Response Time in Broadcast Scheduling
- 21 May 2002
- book chapter
- Published by Springer Nature
- p. 425-438
- https://doi.org/10.1007/3-540-47867-1_30
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Online server allocation in a server farm via benefit task systemsPublished by Association for Computing Machinery (ACM) ,2001
- Algorithms for minimizing weighted flow timePublished by Association for Computing Machinery (ACM) ,2001
- Polynomial-time approximation scheme for data broadcastPublished by Association for Computing Machinery (ACM) ,2000
- Scheduling Broadcasts in Wireless NetworksPublished by Springer Nature ,2000
- A constant-factor approximation algorithm for the k -median problem (extended abstract)Published by Association for Computing Machinery (ACM) ,1999
- R×W: a scheduling approach for large-scale on-demand data broadcastIEEE/ACM Transactions on Networking, 1999
- Dissemination-based data delivery using broadcast disksIEEE Wireless Communications, 1995
- Broadcast disksPublished by Association for Computing Machinery (ACM) ,1995
- Broadcast deliveryProceedings of the IEEE, 1988
- The design of teletext broadcast cyclesPerformance Evaluation, 1985