Broadcast scheduling, algorithms and complexity
From MaRDI portal
Online algorithms; streaming algorithms (68W27) Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Recommendations
- scientific article; zbMATH DE number 2086938
- Algorithms for minimizing response time in broadcast scheduling
- scientific article; zbMATH DE number 1445348
- Improved Approximation Algorithms for Broadcast Scheduling
- A dynamic programming approach of finding an optimal broadcast schedule in minimizing total flow time
Cited in
(15)- Minimizing the maximum flow time in the online food delivery problem
- Freight railcar-to-train assignment and departure scheduling in a railyard
- scientific article; zbMATH DE number 2086938 (Why is no real title available?)
- Algorithms and time complexity of the request-service problem
- The program download problem: complexity and algorithms
- Complexity analysis and algorithms for the program download problem
- Algorithms for minimizing response time in broadcast scheduling
- Scheduling algorithm to select optimal programme slots in television channels: a graph theoretic approach
- Minimizing the maximum flow time in batch scheduling
- Better Scalable Algorithms for Broadcast Scheduling
- Cost-sharing games in real-time scheduling systems
- Better Algorithms and Hardness for Broadcast Scheduling via a Discrepancy Approach
- Cost-sharing games in real-time scheduling systems
- A dynamic programming approach of finding an optimal broadcast schedule in minimizing total flow time
- Scheduling broadcasts with deadlines
This page was built for publication: Broadcast scheduling, algorithms and complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3189032)
