Polynomial-time approximation scheme for data broadcast

DOI10.1145/335305.335398MaRDI QIDQ3192038zbMATH OpenOpenAlexFDO

Authors Nicolas Schabanel, Neal E. Young, Claire 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

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

Recommendations

• scientific article; zbMATH DE number 1305447
• Algorithms for minimizing response time in broadcast scheduling
• The data broadcast problem with non-uniform transmission times
• scientific article; zbMATH DE number 1500517
• Approximating the average response time in broadcast scheduling

Cited in

(16)

• A linearly convergent method for broadcast data allocation
• The data broadcast problem with non-uniform transmission times
• On indexed data broadcast
• Efficient channel allocation tree generation for data broadcasting in a mobile computing environment
• Windows scheduling of arbitrary-length jobs on multiple machines
• Optimization of discrete broadcast under uncertainty using conditional value-at-risk
• Modeling and solving the periodic maintenance problem
• Monitoring an information source under a politeness constraint
• scientific article; zbMATH DE number 1305447 (Why is no real title available?)
• scientific article; zbMATH DE number 2080468 (Why is no real title available?)
• scientific article; zbMATH DE number 1500517 (Why is no real title available?)
• scientific article; zbMATH DE number 1775432 (Why is no real title available?)
• scientific article; zbMATH DE number 1863363 (Why is no real title available?)
• Nearly optimal perfectly periodic schedules
• Broadcast Extensions with Optimal Communication and Round Complexity
• Matheuristics for scheduling of maintenance service with linear operation cost and step function maintenance cost

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

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