A New Approach to Online Scheduling: Approximating the Optimal Competitive Ratio

From MaRDI portal

Revision as of 04:58, 7 March 2024 by Import240305080351 (talk | contribs) (Created automatically from import240305080351)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5741717

Jump to:navigation, search

DOI10.1137/1.9781611973105.9zbMath1421.68247arXiv1204.0897OpenAlexW2950803469MaRDI QIDQ5741717

Elisabeth Günther, Olaf Maurer, Andreas Wiese, Nicole Megow

Publication date: 15 May 2019

Published in: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1204.0897

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Randomized algorithms (68W20) Online algorithms; streaming algorithms (68W27)

Related Items (2)

An asymptotic competitive scheme for online bin packing ⋮ On-line Scheduling with a Monotonous Subsequence Constraint

This page was built for publication: A New Approach to Online Scheduling: Approximating the Optimal Competitive Ratio

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5741717&oldid=30500662"