Algorithms for minimizing response time in broadcast scheduling
From MaRDI portal
(Redirected from Algorithms for minimizing response time in broadcast scheduling)
Algorithms for minimizing response time in broadcast scheduling (scientific article; zbMATH DE number 2086938)
Algorithms for minimizing response time in broadcast scheduling (scientific article; zbMATH DE number 2086938)
Recommendations
Cited in
(14)- Scheduling broadcasts in wireless networks
- Algorithms for minimizing response time in broadcast scheduling
- Scheduling broadcasts with deadlines
- Improved algorithm for broadcast scheduling of minimal latency in wireless ad hoc networks
- A dynamic programming approach of finding an optimal broadcast schedule in minimizing total flow time
- Scheduling broadcasts in wireless networks
- Approximating the average response time in broadcast scheduling
- Broadcast scheduling, algorithms and complexity
- Better Scalable Algorithms for Broadcast Scheduling
- Improved Approximation Algorithms for Broadcast Scheduling
- scientific article; zbMATH DE number 1445348 (Why is no real title available?)
- New approximations for broadcast scheduling via variants of -point rounding
- Computing and Combinatorics
- Equivalence of two linear programming relaxations for broadcast scheduling.
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 Q4737543)