A Polynomial Time Constant Approximation For Minimizing Total Weighted Flow-time
From MaRDI portal
Publication:5236280
DOI10.1137/1.9781611975482.96zbMath1431.68153arXiv1807.09885MaRDI QIDQ5236280
Janardhan Kulkarni, Shi Li, Uriel Feige
Publication date: 15 October 2019
Published in: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1807.09885
68W40: Analysis of algorithms
90B35: Deterministic scheduling theory in operations research
68W25: Approximation algorithms
Related Items
Constant Factor Approximation Algorithm for Weighted Flow-Time on a Single Machine in PseudoPolynomial Time, The online food delivery problem on stars, Fair Scheduling via Iterative Quasi-Uniform Sampling