The data broadcast problem with preemption

DOI10.1007/3-540-46541-3_15MaRDI QIDQ4501534zbMATH OpenFDO

Authors Nicolas Schabanel

Publication date 22 November 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-46541-3_15

zbMATH Keywords

\(NP\)-hardapproximationdata-broadcast problemschedule

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Analysis of algorithms and problem complexity (68Q25) Communication networks in operations research (90B18) Deterministic scheduling theory in operations research (90B35)

Recommendations

• scientific article; zbMATH DE number 1305447
• The data broadcast problem with non-uniform transmission times
• Polynomial-time approximation scheme for data broadcast
• Scheduling broadcasts in wireless networks

Cited in

(6)

• The data broadcast problem with non-uniform transmission times
• Modeling and solving the periodic maintenance problem
• Polynomial-time approximation scheme for data broadcast
• scientific article; zbMATH DE number 1305447 (Why is no real title available?)
• scientific article; zbMATH DE number 2080468 (Why is no real title available?)
• Matheuristics for scheduling of maintenance service with linear operation cost and step function maintenance cost

This page was built for publication: The data broadcast problem with preemption

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