Improved approximation algorithms for broadcast scheduling

DOI10.1145/1109557.1109596zbMath1192.90061OpenAlexW4251996441MaRDI QIDQ3581494

M. I. Sviridenko, Nikhil Bansal, Don Coppersmith

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

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

Related Items (3)

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

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