Improved approximation algorithms for broadcast scheduling

DOI10.1145/1109557.1109596MaRDI QIDQ3581494zbMATH OpenOpenAlexFDO

Authors N. Bansal, Don Coppersmith, Maxim Sviridenko

Publication date 16 August 2010

Published in Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 (Search for Journal in Brave)

Full work available at URL https://research.tue.nl/nl/publications/f3d77fe3-31cc-4b43-aac1-d940c9b06e21

Mathematics Subject Classification ID

Approximation algorithms (68W25) Deterministic scheduling theory in operations research (90B35)

Cited in

(3)

• A dynamic programming approach of finding an optimal broadcast schedule in minimizing total flow time
• Batch machine production with perishability time windows and limited batch size
• A note on on-line broadcast scheduling with deadlines

This page was built for publication: Improved approximation algorithms for broadcast scheduling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3581494)