Broadcast scheduling

DOI10.1145/2000807.2000815zbMath1295.68046OpenAlexW2127274846MaRDI QIDQ3189032

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

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

online algorithmsNP-completenessapproximation algorithms

Mathematics Subject Classification ID

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) Online algorithms; streaming algorithms (68W27)

Related Items (5)

Minimizing the maximum flow time in the online food delivery problem ⋮ Minimizing the maximum flow time in batch scheduling ⋮ A model for minimizing active processor time ⋮ Cost-sharing games in real-time scheduling systems ⋮ Cost-sharing games in real-time scheduling systems

This page was built for publication: Broadcast scheduling