Scheduling data transfers in a network and the set scheduling problem

DOI10.1145/301250.301300zbMath1345.68030OpenAlexW2056870183MaRDI QIDQ2819545

Éva Tardos, Ashish Goel, Monika R. Henzinger, Serge A. Plotkin

Publication date: 29 September 2016

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

Full work available at URL: https://infoscience.epfl.ch/record/99367/files/GoelHPT03.pdf

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) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items

Quantitative fairness for assessing perceived service quality in queues ⋮ Optimal on-line flow time with resource augmentation

This page was built for publication: Scheduling data transfers in a network and the set scheduling problem