Polynomial-time approximation scheme for data broadcast

DOI10.1145/335305.335398zbMath1296.68194OpenAlexW3105368489MaRDI QIDQ3192038

Nicolas Schabanel, Neal E. Young, Claire M. Kenyon

Publication date: 26 September 2014

Published in: Proceedings of the thirty-second annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/335305.335398

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25) Internet topics (68M11)

Related Items (4)

Windows scheduling of arbitrary-length jobs on multiple machines ⋮ Optimization of discrete broadcast under uncertainty using conditional value-at-risk ⋮ Nearly optimal perfectly periodic schedules ⋮ Modeling and solving the periodic maintenance problem

This page was built for publication: Polynomial-time approximation scheme for data broadcast