Fair Scheduling via Iterative Quasi-Uniform Sampling

DOI10.1137/1.9781611974782.171zbMath1414.90153OpenAlexW4247793956MaRDI QIDQ4575920

Sungjin Im, Benjamin Moseley

Publication date: 16 July 2018

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

Full work available at URL: https://doi.org/10.1137/1.9781611974782.171

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)

Related Items (4)

Constant Factor Approximation Algorithm for Weighted Flow-Time on a Single Machine in PseudoPolynomial Time ⋮ Unnamed Item ⋮ Non-clairvoyantly scheduling to minimize convex functions ⋮ Constant Factor Approximation Algorithm for Weighted Flow-Time on a Single Machine in PseudoPolynomial Time

This page was built for publication: Fair Scheduling via Iterative Quasi-Uniform Sampling