The data broadcast problem with non-uniform transmission times

DOI10.1007/S00453-002-0990-5zbMath1026.68012OpenAlexW3139082172MaRDI QIDQ1566380

Nicolas Schabanel, Claire M. Kenyon

Publication date: 2 June 2003

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-002-0990-5

zbMATH Keywords

schedulingNP-completenessapproximation algorithmsrandomized algorithmsdata broadcasting

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Randomized algorithms (68W20)

Related Items (4)

The weighted fair sequences problem ⋮ An efficient implementation of a VNS heuristic for the weighted fair sequences problem ⋮ Batch machine production with perishability time windows and limited batch size ⋮ Windows scheduling of arbitrary-length jobs on multiple machines

This page was built for publication: The data broadcast problem with non-uniform transmission times