The loss of serving in the dark

DOI10.1145/2488608.2488729zbMath1293.90020OpenAlexW1998009987MaRDI QIDQ5495867

Ilan Reuven Cohen, Iftah Gamzu, Yossi Azar

Publication date: 7 August 2014

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

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

zbMATH Keywords

online algorithmscompetitive ratioballs and binszero-one principlepackets schedulingprompt mechanisms

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Online algorithms; streaming algorithms (68W27)

Related Items

Serving in the Dark should be done Non-Uniformly ⋮ The loss of serving in the dark ⋮ Comparison-based buffer management in QoS switches

This page was built for publication: The loss of serving in the dark