Algorithms - ESA 2003
From MaRDI portal
Publication:5897256
DOI10.1007/B13632zbMATH Open1266.68072OpenAlexW1827234103MaRDI QIDQ5897256FDOQ5897256
Authors: Bala Kalyanasundaram, Mahe Velauthapillai 
Publication date: 3 March 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b13632
Recommendations
- Scheduling broadcasts with deadlines
- Scheduling broadcasts with deadlines
- Improved On-Line Broadcast Scheduling with Deadlines
- Improved on-line broadcast scheduling with deadlines
- ON-DEMAND BOUNDED BROADCAST SCHEDULING WITH TIGHT DEADLINES
- A note on on-line broadcast scheduling with deadlines
- Computing and Combinatorics
- On time-relaxed broadcasting networks
- Hybrid broadcast for the video-on-demand service
Cited In (16)
- Design and analysis of online batching systems
- Improved on-line broadcast scheduling with deadlines
- Scheduling on-demand data broadcast in mixed-type request environments
- A note on on-line broadcast scheduling with deadlines
- Improved online algorithms for the batch scheduling of equal-length jobs with incompatible families to maximize the weighted number of early jobs
- Improved On-Line Broadcast Scheduling with Deadlines
- Computing and Combinatorics
- A tighter extra-resource analysis of online deadline scheduling
- A Near Optimal Scheduler for On-Demand Data Broadcasts
- ON-DEMAND BOUNDED BROADCAST SCHEDULING WITH TIGHT DEADLINES
- Theoretical Computer Science
- Competitive analysis of most-request-first for scheduling broadcasts with start-up delay
- A near optimal scheduler for on-demand data broadcasts
- Scheduling broadcasts with deadlines
- Scheduling broadcasts with deadlines
- Scheduling real-time requests in on-demand data broadcast environments
This page was built for publication: Algorithms - ESA 2003
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5897256)
