New models and algorithms for throughput maximization in broadcast scheduling (extended abstract)

DOI10.1007/978-3-642-18318-8_7MaRDI QIDQ3075451zbMATH OpenOpenAlexFDO

Authors Chandra Chekuri, Avigdor Gal, Sungjin Im, Samir Khuller, Jian Li, Richard Matthew McCutchen, Benjamin Moseley, Louiqa Raschid

Publication date 15 February 2011

Published in Approximation and Online Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-18318-8_7

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• Publication:4952666
• Scheduling broadcasts with deadlines
• Scheduling broadcasts with deadlines
• Improved Approximation Algorithms for Broadcast Scheduling
• scientific article; zbMATH DE number 1670667

Cited in

(2)

• Minimizing the maximum flow time in batch scheduling
• Efficient scheduling of periodic information monitoring requests

This page was built for publication: New models and algorithms for throughput maximization in broadcast scheduling (extended abstract)

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