Algorithms for minimizing response time in broadcast scheduling
From MaRDI portal
Publication:1879255
DOI10.1007/S00453-003-1058-XzbMATH Open1138.68665OpenAlexW2020636116MaRDI QIDQ1879255FDOQ1879255
Authors: Rajiv Gandhi, Samir Khuller, Yoo-Ah Kim, Yung-Chun Justin Wan 
Publication date: 22 September 2004
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-003-1058-x
Recommendations
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25) Theory of operating systems (68N25)
Cited In (17)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Improved on-line broadcast scheduling with deadlines
- Polynomial-time approximation scheme for data broadcast
- Equivalence of two linear programming relaxations for broadcast scheduling.
- Title not available (Why is that?)
- Improved algorithm for broadcast scheduling of minimal latency in wireless ad hoc networks
- Better Scalable Algorithms for Broadcast Scheduling
- Approximating the average response time in broadcast scheduling
- Improved Approximation Algorithms for Broadcast Scheduling
- Better Algorithms and Hardness for Broadcast Scheduling via a Discrepancy Approach
- Computing and Combinatorics
- A dynamic programming approach of finding an optimal broadcast schedule in minimizing total flow time
- Better scalable algorithms for broadcast scheduling
- Scheduling broadcasts in wireless networks
- Broadcast scheduling, algorithms and complexity
- New approximations for broadcast scheduling via variants of \(\alpha\)-point rounding
This page was built for publication: Algorithms for minimizing response time in broadcast scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1879255)
