Algorithms for minimizing response time in broadcast scheduling
From MaRDI portal
Recommendations
Cited in
(17)- scientific article; zbMATH DE number 1445348 (Why is no real title available?)
- Better Scalable Algorithms for Broadcast Scheduling
- Approximating the average response time in broadcast scheduling
- scientific article; zbMATH DE number 1670667 (Why is no real title available?)
- Better Algorithms and Hardness for Broadcast Scheduling via a Discrepancy Approach
- scientific article; zbMATH DE number 2086938 (Why is no real title available?)
- Improved algorithm for broadcast scheduling of minimal latency in wireless ad hoc networks
- Improved Approximation Algorithms for Broadcast Scheduling
- Computing and Combinatorics
- Improved on-line broadcast scheduling with deadlines
- Scheduling broadcasts in wireless networks
- Broadcast scheduling, algorithms and complexity
- A dynamic programming approach of finding an optimal broadcast schedule in minimizing total flow time
- Polynomial-time approximation scheme for data broadcast
- Equivalence of two linear programming relaxations for broadcast scheduling.
- Better scalable algorithms for broadcast scheduling
- 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)