A near optimal scheduler for on-demand data broadcasts
From MaRDI portal
Publication:935145
DOI10.1016/j.tcs.2008.03.031zbMath1161.68009OpenAlexW2049176717MaRDI QIDQ935145
Publication date: 31 July 2008
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2008.03.031
Related Items
Online scheduling of bounded length jobs to maximize throughput, Improved randomized online scheduling of intervals and jobs, On Job Scheduling with Preemption Penalties
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A tight lower bound for job scheduling with cancellation
- On-line scheduling of jobs with fixed start and end times
- Scheduling broadcasts in wireless networks
- Multicast pull scheduling: When fairness is fine
- Scheduling broadcasts with deadlines
- A maiden analysis of longest wait first
- Computing and Combinatorics
- Theoretical Computer Science
- Algorithms - ESA 2003