Broadcast scheduling, algorithms and complexity

DOI10.1145/2000807.2000815MaRDI QIDQ3189032zbMATH OpenOpenAlexWikidataFDO

Authors Jessica Chang, Thomas Erlebach, Renars Gailis, Samir Khuller

Publication date 9 September 2014

Published in ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2000807.2000815

zbMATH Keywords

approximation algorithmsNP-completenessonline algorithms

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25) Online algorithms; streaming algorithms (68W27) Deterministic scheduling theory in operations research (90B35)

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

(16)

• Minimizing the maximum flow time in batch scheduling
• Scheduling algorithm to select optimal programme slots in television channels: a graph theoretic approach
• Algorithms for minimizing response time in broadcast scheduling
• Scheduling broadcasts with deadlines
• Complexity analysis and algorithms for the program download problem
• A dynamic programming approach of finding an optimal broadcast schedule in minimizing total flow time
• Better Scalable Algorithms for Broadcast Scheduling
• scientific article; zbMATH DE number 2086938 (Why is no real title available?)
• The program download problem: complexity and algorithms
• Better Algorithms and Hardness for Broadcast Scheduling via a Discrepancy Approach
• Cost-sharing games in real-time scheduling systems
• Cost-sharing games in real-time scheduling systems
• Minimizing the maximum flow time in the online food delivery problem
• Freight railcar-to-train assignment and departure scheduling in a railyard
• Algorithms and time complexity of the request-service problem
• Interval scheduling games

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)