New approximations for broadcast scheduling via variants of -point rounding

DOI10.1137/1.9781611973730.71MaRDI QIDQ5362999zbMATH OpenOpenAlexFDO

Authors Sungjin Im, Maxim Sviridenko

Publication date 5 October 2017

Published in Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1.9781611973730.71

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)

Recommendations

• Improved Approximation Algorithms for Broadcast Scheduling
• Better scalable algorithms for broadcast scheduling
• Better Scalable Algorithms for Broadcast Scheduling
• Algorithms for minimizing response time in broadcast scheduling
• scientific article; zbMATH DE number 2086938

Cited in

(2)

• Minimizing the maximum flow time in batch scheduling
• Better Algorithms and Hardness for Broadcast Scheduling via a Discrepancy Approach

This page was built for publication: New approximations for broadcast scheduling via variants of \(\alpha\)-point rounding

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